Checking the Convexity of Polytopes and the Planarity of Subdivisions - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports Year : 1998

Checking the Convexity of Polytopes and the Planarity of Subdivisions

Olivier Devillers
Giuseppe Liotta
  • Function : Author
Franco P. Preparata
  • Function : Author
Roberto Tamassia
  • Function : Author

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.
Fichier principal
Vignette du fichier
RR-3527.pdf (269.07 Ko) Télécharger le fichier

Dates and versions

inria-00073158 , version 1 (24-05-2006)

Identifiers

  • HAL Id : inria-00073158 , version 1

Cite

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

Share

Gmail Facebook X LinkedIn More