Sciweavers

91 search results - page 1 / 19
» Triangulating a Plane
Sort
View
FSTTCS
2007
Springer
13 years 11 months ago
Triangulations of Line Segment Sets in the Plane
Given a set S of line segments in the plane, we introduce a new family of partitions of the convex hull of S called segment triangulations of S. The set of faces of such a triangul...
Mathieu Brévilliers, Nicolas Chevallier, Do...
JCO
2010
169views more  JCO 2010»
13 years 3 months ago
An almost four-approximation algorithm for maximum weight triangulation
We consider the following planar maximum weight triangulation (MAT) problem: given a set of n points in the plane, find a triangulation such that the total length of edges in tria...
Shiyan Hu
CORR
2007
Springer
182views Education» more  CORR 2007»
13 years 4 months ago
Triangulating the Real Projective Plane
We consider the problem of computing a triangulation of the real projective plane P2 , given a finite point set P = {p1, p2, . . . , pn} as input. We prove that a triangulation of...
Mridul Aanjaneya, Monique Teillaud
DM
2002
186views more  DM 2002»
13 years 4 months ago
Coloring Eulerian triangulations of the projective plane
A simple characterization of the 3, 4, or 5-colorable Eulerian triangulations of the projective plane is given. Key words: Projective plane, triangulation, coloring, Eulerian grap...
Bojan Mohar
COMPGEOM
2001
ACM
13 years 8 months ago
Walking in a triangulation
Given a triangulation in the plane or a tetrahedralization in 3-space, we investigate the efficiency of locating a point by walking in the structure with different
Olivier Devillers, Sylvain Pion, Monique Teillaud