inria-00172999, version 3
Triangulating the Real Projective Plane
Mridul Aanjaneya
1, 2Monique Teillaud 2
N° RR-6296 (2007)
Résumé : We consider the problem of computing a triangulation of the real projective plane P2, given a finite point set S={p1, p2,..., pn} as input. We prove that a triangulation of P2 always exists if at least six points in S are in general position, i.e., no three of them are collinear. We also design an algorithm for triangulating P2 if this necessary condition holds. As far as we know, this is the first computational result on the real projective plane.
- 1 : Department of Computer Science and Engineering
- IIT Kharagpur
- 2 : GEOMETRICA (INRIA Sophia Antipolis / INRIA Futurs)
- INRIA
- Domaine : Informatique/Géométrie algorithmique
- Mots-clés : Computational geometry – triangulation – simplicial complex – projective geometry – algorithm
- Référence interne : RR-6296
- Versions disponibles : v1 (18-09-2007) v2 (18-09-2007) v3 (14-12-2007)
- inria-00172999, version 3
- http://hal.inria.fr/inria-00172999
- oai:hal.inria.fr:inria-00172999
- Contributeur : Monique Teillaud
- Soumis le : Vendredi 14 Décembre 2007, 16:15:40
- Dernière modification le : Jeudi 16 Octobre 2008, 15:53:48
Documents associés
Exporter