Deutsch
 
Hilfe Datenschutzhinweis Impressum
  DetailsucheBrowse

Datensatz

DATENSATZ AKTIONENEXPORT
 
 
DownloadE-Mail
 Lokale TagsFreigabegeschichteDetailsÜbersicht
  Exact, Efficient and Complete Arrangement Computation for Cubic Curves

Eigenwillig, A., Kettner, L., Schömer, E., & Wolpert, N. (2006). Exact, Efficient and Complete Arrangement Computation for Cubic Curves. Computational Geometry, 35, 36-73.

Item is

 

einblenden: alle ausblenden: alle

Basisdaten

einblenden: ausblenden:
Datensatz-Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-22C2-8 Versions-Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-22C3-6
Genre: Zeitschriftenartikel

Dateien

einblenden: Dateien
ausblenden: Dateien
:
EKSW-Cubics-CGTA-authprep.pdf (beliebiger Volltext), 494KB
 
Datei-Permalink:
-
Name:
EKSW-Cubics-CGTA-authprep.pdf
Beschreibung:
-
OA-Status:
Sichtbarkeit:
Privat
MIME-Typ / Prüfsumme:
application/pdf
Technische Metadaten:
Copyright Datum:
-
Copyright Info:
Copyright © 2005 Elsevier B.V. All rights reserved. This article has been published in Computational Geometry 35(1-2), August 2006, Pages 36-73.
Lizenz:
-

Externe Referenzen

einblenden:

Urheber

einblenden:
ausblenden:
 Urheber:
Eigenwillig, Arno1, Autor           
Kettner, Lutz1, Autor           
Schömer, Elmar1, Autor           
Wolpert, Nicola1, Autor           
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Inhalt

einblenden:
ausblenden:
Schlagwörter: -
 Zusammenfassung: The Bentley-Ottmann sweep-line method can compute the arrangement of planar curves, provided a number of geometric primitives operating on the curves are available. We discuss the reduction of the primitives to the analysis of curves and curve pairs, and describe efficient realizations of these analyses for planar algebraic curves of degree three or less. We obtain a \emph{complete}, \emph{exact}, and \emph{efficient\/} algorithm for computing arrangements of cubic curves. Special cases of cubic curves are conics as well as implicitized cubic splines and B\'ezier curves. The algorithm is \emph{complete\/} in that it handles all possible degeneracies such as tangential intersections and singularities. It is \emph{exact\/} in that it provides the mathematically correct result. It is \emph{efficient\/} in that it can handle hundreds of curves with a quarter million of segments in the final arrangement. The algorithm has been implemented in C\texttt{++} as an \textsc{Exacus} library called \textsc{CubiX}.

Details

einblenden:
ausblenden:
Sprache(n): eng - English
 Datum: 2007-02-102006
 Publikationsstatus: Erschienen
 Seiten: -
 Ort, Verlag, Ausgabe: -
 Inhaltsverzeichnis: -
 Art der Begutachtung: Expertenbegutachtung
 Identifikatoren: eDoc: 314461
Anderer: Local-ID: C1256428004B93B8-9FBA65AC1148D2AEC1257176004AA8EE-eksw-eecaccc-06
 Art des Abschluß: -

Veranstaltung

einblenden:

Entscheidung

einblenden:

Projektinformation

einblenden:

Quelle 1

einblenden:
ausblenden:
Titel: Computational Geometry
Genre der Quelle: Zeitschrift
 Urheber:
Affiliations:
Ort, Verlag, Ausgabe: -
Seiten: - Band / Heft: 35 Artikelnummer: - Start- / Endseite: 36 - 73 Identifikator: ISSN: 0925-7721