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 :
Reports
Complete list of metadatas

https://hal.inria.fr/inria-00073158
Contributor : Rapport de Recherche Inria <>
Submitted on : Wednesday, May 24, 2006 - 12:01:11 PM
Last modification on : Saturday, January 27, 2018 - 1:31:31 AM
Long-term archiving on : Sunday, April 4, 2010 - 11:36:13 PM

Identifiers

  • HAL Id : inria-00073158, version 1

Collections

Citation

Olivier Devillers, Giuseppe Liotta, Franco Preparata, Roberto Tamassia. Checking the Convexity of Polytopes and the Planarity of Subdivisions. RR-3527, INRIA. 1998. ⟨inria-00073158⟩

Share

Metrics

Record views

190

Files downloads

274