Work

Triangulating the Real Projective Plane

Year: 2007

Type: preprint

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.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.0709.2831

Authors: Aanjaneya, Mridul, Teillaud, Monique

Institutions: Institut national de recherche en sciences et technologies du numérique, Indian Institute of Technology Kharagpur, Centre Inria d'Université Côte d'Azur

Language: English

Topic: Computational Geometry and Mesh Generation

Subfield: Computer Graphics and Computer-Aided Design

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W1810282896

Cites: 19

Cited by: 4

Related to: 20