Checking the convexity of polytopes and the planarity of subdivisions.

Abstract : This paper considers the problem of verifying the correctness of geometric structures. In particular, we design simple optimal checkers for convex polytopes in two and higher dimensions, and for various types of planar subdivisions, such as triangulations, Delaunay triangulations, and convex subdivisions. Their performance is analyzed also in terms of the algorithmic degree, which characterizes the arithmetic precision required.
Document type :
Journal articles
Complete list of metadatas

https://hal.inria.fr/inria-00413179
Contributor : Olivier Devillers <>
Submitted on : Thursday, September 3, 2009 - 1:56:46 PM
Last modification on : Thursday, November 8, 2018 - 10:58:32 AM
Long-term archiving on : Tuesday, June 15, 2010 - 9:22:48 PM

File

dlpt-ccpps-98.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Olivier Devillers, Giuseppe Liotta, Franco Preparata, Roberto Tamassia. Checking the convexity of polytopes and the planarity of subdivisions.. Computational Geometry, Elsevier, 1998, 11, pp.187-208. ⟨10.1016/S0925-7721(98)00039-X⟩. ⟨inria-00413179⟩

Share

Metrics

Record views

578

Files downloads

164