inria-00413179, version 1
Checking the convexity of polytopes and the planarity of subdivisions.
Olivier Devillers
1Giuseppe Liotta 2Franco Preparata a, 3Roberto Tamassia 3
Computational Geometry 11 (1998) 187-208
Résumé : 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.
- a – John Brown University
- 1 : PRISME (INRIA Sophia Antipolis)
- INRIA
- 2 : School of Computing
- University of Perugia
- 3 : Department of Computer Science (Brown University)
- Brown University
- Domaine : Informatique/Géométrie algorithmique
- inria-00413179, version 1
- http://hal.inria.fr/inria-00413179
- oai:hal.inria.fr:inria-00413179
- Contributeur : Olivier Devillers
- Soumis le : Jeudi 3 Septembre 2009, 13:56:46
- Dernière modification le : Jeudi 3 Septembre 2009, 14:18:35
Documents associés
Exporter