Skip to Main content Skip to Navigation
Conference papers

A Generic Lazy Evaluation Scheme for Exact Geometric Computations

Abstract : We present a generic C++ design to perform efficient and exact geometric computations using lazy evaluations. Exact geometric computations are critical for the robustness of geometric algorithms. Their efficiency is also critical for most applications, hence the need for delaying the exact computations at run time until they are actually needed. Our approach is generic and extensible in the sense that it is possible to make it a library which users can extend to their own geometric objects or primitives. It involves techniques such as generic functor adaptors, dynamic polymorphism, reference counting for the management of directed acyclic graphs and exception handling for detecting cases where exact computations are needed. It also relies on multiple precision arithmetic as well as interval arithmetic. We apply our approach to the whole geometric kernel of Cgal.
Complete list of metadatas

Cited literature [15 references]  Display  Hide  Download

https://hal.inria.fr/inria-00344960
Contributor : Sylvain Pion <>
Submitted on : Sunday, December 7, 2008 - 11:29:21 PM
Last modification on : Thursday, March 5, 2020 - 4:53:35 PM
Long-term archiving on: : Monday, June 7, 2010 - 11:51:48 PM

File

lazy-kernel.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00344960, version 1

Collections

Citation

Sylvain Pion, Andreas Fabri. A Generic Lazy Evaluation Scheme for Exact Geometric Computations. Library Centric Software Design (LCSD), Oct 2006, Portland, Oregon, United States. ⟨inria-00344960⟩

Share

Metrics

Record views

384

Files downloads

414