Efficient Exact Geometric Predicates for Delaunay Triangulations - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports Year : 2002

Efficient Exact Geometric Predicates for Delaunay Triangulations

Olivier Devillers
Sylvain Pion

Abstract

A time efficient implementation of the exact computation paradigm relies on arithmetic filters which are used to speed up the exact computation of easy instances of the geometric predicates. Depending of what is called ``easy instances'', we usually classify filters as static or dynamic and also some in between categories often called semi-static. In this paper, we propose, in the context of three dimensional Delaunay triangulations: automatic tools for the writing of static and semi-static filters, a new semi-static level of filtering called translation filter, detailed benchmarks of the success rates of these filters and comparison with rounded arithmetic, long integer arithmetic and filters provided in Shewchuk's predicates. Our method is general and can be applied to all geometric predicates on points that can be expressed as signs of polynomial expressions. This work is applied in the CGAL library.
Fichier principal
Vignette du fichier
RR-4351.pdf (338.59 Ko) Télécharger le fichier

Dates and versions

inria-00072237 , version 1 (23-05-2006)

Identifiers

  • HAL Id : inria-00072237 , version 1

Cite

Olivier Devillers, Sylvain Pion. Efficient Exact Geometric Predicates for Delaunay Triangulations. RR-4351, INRIA. 2002. ⟨inria-00072237⟩
132 View
1017 Download

Share

Gmail Facebook X LinkedIn More