Triangulating the Real Projective Plane - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2007

Triangulating the Real Projective Plane


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.
Fichier principal
Vignette du fichier
RR.pdf (258.11 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00172999 , version 1 (18-09-2007)
inria-00172999 , version 2 (18-09-2007)
inria-00172999 , version 3 (14-12-2007)


  • HAL Id : inria-00172999 , version 3
  • ARXIV : 0709.2831


Mridul Aanjaneya, Monique Teillaud. Triangulating the Real Projective Plane. [Research Report] RR-6296, INRIA. 2007, pp.11. ⟨inria-00172999v3⟩
148 View
282 Download



Gmail Facebook X LinkedIn More