Triangulating the Real Projective Plane

Details Triangulating the Real Projective Plane Triangulating the Real Projective Plane

2007-09-18

arxiv.org/abs/0709.2831v2

Computer Science

Computational Geometry

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Triangulating the Real Projective Plane does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Triangulating the Real Projective Plane, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Triangulating the Real Projective Plane will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-457102