A Generic Lazy Evaluation Scheme for Exact Geometric Computations - Archive ouverte HAL Access content directly
Journal Articles Science of Computer Programming Year : 2011

A Generic Lazy Evaluation Scheme for Exact Geometric Computations

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

Abstract

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

Dates and versions

inria-00562300 , version 1 (03-02-2011)

Identifiers

Cite

Sylvain Pion, Andreas Fabri. A Generic Lazy Evaluation Scheme for Exact Geometric Computations. Science of Computer Programming, 2011, Special issue on library-centric software design (LCSD 2006), 76 (4), pp.307-323. ⟨10.1016/j.scico.2010.09.003⟩. ⟨inria-00562300⟩

Collections

INRIA INRIA2
234 View
297 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More