Sciweavers

101 search results - page 1 / 21
» A lower bound on the number of triangulations of planar poin...
Sort
View
COMGEO
2004
ACM
13 years 4 months ago
A lower bound on the number of triangulations of planar point sets
We show that the number of straight-edge triangulations exhibited by any set of n points in general position in the plane is bounded from below by (2.33n). 2004 Elsevier B.V. All ...
Oswin Aichholzer, Ferran Hurtado, Marc Noy
COMPGEOM
2010
ACM
13 years 9 months ago
On degrees in random triangulations of point sets
We study the expected number of interior vertices of degree i in a triangulation of a point set S, drawn uniformly at random from the set of all triangulations of S, and derive va...
Micha Sharir, Adam Sheffer, Emo Welzl
COMPGEOM
2006
ACM
13 years 10 months ago
Random triangulations of planar point sets
Let S be a finite set of n + 3 points in general position in the plane, with 3 extreme points and n interior points. We consider triangulations drawn uniformly at random from the...
Micha Sharir, Emo Welzl
JCO
2010
169views more  JCO 2010»
13 years 2 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
CIAC
2010
Springer
252views Algorithms» more  CIAC 2010»
13 years 9 months ago
On the Number of Higher Order Delaunay Triangulations
Higher order Delaunay triangulations are a generalization of the Delaunay triangulation which provides a class of well-shaped triangulations, over which extra criteria can be optim...
Dieter Mitsche, Maria Saumell, Rodrigo I. Silveira