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

Delaunay Triangulations for Moving Points

apport de recherch

Contents Doc No: N1843=05-0103 A Proposal to add Interval Arithmetic to the C++ Standard Library

Interval arithmetic is a basic tool for certified mathematical computations, it is presented in many references. We describe here the formal proposal to include interval arithmetic in the C++ standard library