English
 
User Manual Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

EXACUS: Efficient and Exact Algorithms for Curves and Surfaces

MPS-Authors
/persons/resource/persons44118

Berberich,  Eric
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons44369

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

/persons/resource/persons44766

Kettner,  Lutz
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45021

Mehlhorn,  Kurt
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45275

Reichel,  Joachim
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45404

Schmitt,  Susanne
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45758

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

External Ressource
No external resources are shared
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Berberich, E., Eigenwillig, A., Hemmer, M., Hert, S., Kettner, L., Mehlhorn, K., et al. (2005). EXACUS: Efficient and Exact Algorithms for Curves and Surfaces. In G. Stølting Brodal, & S. Leonardi (Eds.), Algorithms -- ESA 2005 (pp. 155-166). Berlin, Germany: Springer. doi:10.1007/11561071_16.


Cite as: http://hdl.handle.net/11858/00-001M-0000-000F-2677-0
Abstract
We present the first open-source release of the C\texttt{++} libraries of the \textsc{Exacus} project of the Max-Planck-Institut f{\"u}r Informatik. Our software computes arrangements of curves and curve segments, and boolean operations on polygons bounded by curve segments. We pursued the goals efficiency, correctness, and completeness for all input cases, implying robustness. We present the structure of the libraries and their generic design. With our work we contribute one milestone on the way towards a systematic support of non-linear geometry in software libraries.