Deutsch
 
Benutzerhandbuch Datenschutzhinweis Impressum Kontakt
  DetailsucheBrowse

Datensatz

DATENSATZ AKTIONENEXPORT

Freigegeben

Bericht

Sweeping Arrangements of Cubic Segments Exactly and Efficiently

MPG-Autoren
/persons/resource/persons44369

Eigenwillig,  Arno
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45414

Schömer,  Elmar
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45758

Wolpert,  Nicola
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

Externe Ressourcen
Es sind keine Externen Ressourcen verfügbar
Volltexte (frei zugänglich)
Es sind keine frei zugänglichen Volltexte verfügbar
Ergänzendes Material (frei zugänglich)
Es sind keine frei zugänglichen Ergänzenden Materialien verfügbar
Zitation

Eigenwillig, A., Schömer, E., & Wolpert, N.(2002). Sweeping Arrangements of Cubic Segments Exactly and Efficiently (ECG-TR-182202-01). Sophia Antipolis: Effective Computational Geometry for Curves and Surfaces.


Zitierlink: http://hdl.handle.net/11858/00-001M-0000-0019-EB42-7
Zusammenfassung
A method is presented to compute the planar arrangement induced by segments of algebraic curves of degree three (or less), using an improved Bentley-Ottmann sweep-line algorithm. Our method is exact (it provides the mathematically correct result), complete (it handles all possible geometric degeneracies), and efficient (the implementation can handle hundreds of segments). The range of possible input segments comprises conic arcs and cubic splines as special cases of particular practical importance.