Skip to Main content Skip to Navigation
Reports

Triangulating the Real Projective Plane

Abstract : 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.
Document type :
Reports
Complete list of metadatas

Cited literature [21 references]  Display  Hide  Download

https://hal.inria.fr/inria-00172999
Contributor : Monique Teillaud <>
Submitted on : Friday, December 14, 2007 - 4:15:40 PM
Last modification on : Wednesday, October 30, 2019 - 7:36:17 PM
Long-term archiving on: : Thursday, September 23, 2010 - 4:56:54 PM

Files

RR.pdf
Files produced by the author(s)

Identifiers

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

Collections

Citation

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

Share

Metrics

Record views

352

Files downloads

394