Skip to Main content Skip to Navigation

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 :
Complete list of metadata
Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Wednesday, May 24, 2006 - 12:01:11 PM
Last modification on : Thursday, January 20, 2022 - 4:19:25 PM
Long-term archiving on: : Sunday, April 4, 2010 - 11:36:13 PM


  • HAL Id : inria-00073158, version 1



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



Les métriques sont temporairement indisponibles