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...
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...
: This note proposes a simple rule to determine a unique triangulation among all Delaunay triangulations of a planar point set, based on two preferred directions. We show that the ...
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
We introduce series-triangular graph embeddings and show how to partition point sets with them. This result is then used to prove an upper bound on the number of Steiner points nee...