English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Conference Paper

Efficient exact geometric computation made easy

MPS-Authors
/persons/resource/persons44210

Burnikel,  Christoph
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons44431

Fleischer,  Rudolf
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/persons45391

Schirra,  Stefan
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Burnikel, C., Fleischer, R., Mehlhorn, K., & Schirra, S. (1999). Efficient exact geometric computation made easy. In Proceedings of the 15th Annual Symposium on Computational Geometry (SCG-99) (pp. 341-350). New York, USA: ACM.


Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-3566-6
Abstract
We show that the combination of the CGAL framework for geometric computation and the number type leda-real yields easy-to-write, correct and efficient geometric programs.