A generic lazy evaluation scheme for exact geometric computations

✍ Scribed by Sylvain Pion; Andreas Fabri

• Book ID: 104092031
• Publisher: Elsevier Science
• Year: 2011
• Tongue: English
• Weight: 409 KB
• Volume: 76
• Category: Article
• ISSN: 0167-6423
• DOI: 10.1016/j.scico.2010.09.003

✦ Synopsis

We present a generic C++ design to perform exact geometric computations efficiently using lazy evaluations. Exact geometric computations are critical for the robustness of geometric algorithms. Their efficiency is also important for many applications, hence the need for delaying the costly exact computations at run time until they are actually needed, if at all. Our approach is generic and extensible in the sense that it is possible to make it a library that users can apply to their own geometric objects and primitives. It involves techniques such as generic functor-adaptors, static and dynamic polymorphism, reference counting for the management of directed acyclic graphs, and exception handling for triggering exact computations when needed. It also relies on multi-precision arithmetic as well as interval arithmetic. We apply our approach to the whole geometry kernel of Cgal.