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 ...
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...
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...
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...
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