Help Privacy Policy Disclaimer
  Advanced SearchBrowse




Conference Paper

Reliable and Efficient Geometric Computing


Mehlhorn,  Kurt
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

Mehlhorn, K. (2006). Reliable and Efficient Geometric Computing. In Algorithms and Complexity: 6th Italian Conference, CIAC 2006 (pp. 1-2). Berlin, Germany: Springer.

Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-23D8-E
Reliable implementation of geometric algorithms is a notoriously difficult task. Algorithms are usually designed for the Real-RAM, capable of computing with real numbers in the sense of mathematics, and for non-degenerate inputs. But, real computers are not Real-RAMs and inputs are frequently degenerate. In the first part of the talk we illustrate the pitfalls of geometric computing by way of examples [KMP+04]. The examples demonstrate in a lucid way that standard and frequently taught algorithms can go completely astray when naively implemented with floating point arithmetic. Partially supported by the IST Programme of the EU under Contract No IST-2005-TODO, Algorithms for Complex Shapes (ACS).