Further Results on Arithmetic Filters for Geometric Predicates

Abstract : An efficient technique to solve precision problems consists in using exact computations. For geometric predicates, using systematically expensive exact computations can be avoided by the use of filters. The predicate is first evaluated using rounding computations, and an error estimation gives a certificate of the validity of the result. In this note, we studies the statistical efficiency of filters for cosphericity predicate with an assumption of regular distribution of the points. We prove that the expected value of the polynomial corresponding to the in sphere test is greater than epsilon with probability O(epsilon log 1/epsilon) improving the results of a previous paper.
Document type :
Journal articles
Complete list of metadatas

Cited literature [1 references]  Display  Hide  Download

https://hal.inria.fr/inria-00168163
Contributor : Olivier Devillers <>
Submitted on : Friday, August 24, 2007 - 5:42:10 PM
Last modification on : Wednesday, March 7, 2018 - 10:10:56 AM
Long-term archiving on : Friday, April 9, 2010 - 1:07:29 AM

File

comgeo350.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Olivier Devillers, Franco Preparata. Further Results on Arithmetic Filters for Geometric Predicates. Computational Geometry, Elsevier, 1999, 13, pp.141-148. ⟨10.1016/S0925-7721(99)00011-5⟩. ⟨inria-00168163⟩

Share

Metrics

Record views

278

Files downloads

235