A Generic Lazy Evaluation Scheme for Exact Geometric Computations - Archive ouverte HAL Access content directly
Conference Papers Year : 2006

A Generic Lazy Evaluation Scheme for Exact Geometric Computations

(1) , (2)
Sylvain Pion
Andreas Fabri
  • Function : Author
  • PersonId : 833595


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.
Fichier principal
Vignette du fichier
lazy-kernel.pdf (183.6 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00344960 , version 1 (07-12-2008)


  • HAL Id : inria-00344960 , version 1


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⟩


177 View
274 Download


Gmail Facebook Twitter LinkedIn More