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.
Type de document :
Rapport
RR-3527, INRIA. 1998
Liste complète des métadonnées

https://hal.inria.fr/inria-00073158
Contributeur : Rapport de Recherche Inria <>
Soumis le : mercredi 24 mai 2006 - 12:01:11
Dernière modification le : samedi 27 janvier 2018 - 01:31:31
Document(s) archivé(s) le : dimanche 4 avril 2010 - 23:36:13

Fichiers

Identifiants

  • 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〉

Partager

Métriques

Consultations de la notice

173

Téléchargements de fichiers

199