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

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
alenex03.pdf (3.26 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00344517 , version 1 (05-12-2008)

Identifiers

  • HAL Id : inria-00344517 , version 1

Cite

Olivier Devillers, Sylvain Pion. Efficient Exact Geometric Predicates for Delaunay Triangulations. Proceedings of the 5th Workshop on Algorithm Engineering and Experiments, Jan 2003, Baltimore, Maryland, United States. pp.37-44. ⟨inria-00344517⟩
308 View
287 Download

Share

Gmail Facebook X LinkedIn More