Generalized Delaunay Triangulations:Graph-Theoretic Properties and Algorithms

This thesis studies different generalizations of Delaunay triangulations, both from a combinatorial and algorithmic point of view. The Delaunay triangulation of a point set S, denoted DT(S), has vertex set S. An edge uv is in DT(S) if it satisfies the empty circle property: there exists a circle with u and v on its boundary that does not enclose points of S. Due to different optimization criteria, many generalizations of the DT(S) have been proposed. Several properties are known for DT(S), yet, few are known for its generalizations. The main question we explore is: to what extent can properties of DT(S) be extended for generalized Delaunay graphs? First, we explore the connectivity of the flip graph of higher order Delaunay triangulations of a point set S in the plane. The order-k flip graph might be disconnected for k ≥ 3, yet, we give upper and lower bounds on the flip distance from one order-k triangulation to another in certain settings. Later, we show that there exists a length-decreasing sequence of plane spanning trees of S that converges to the minimum spanning tree of S with respect to an arbitrary convex distance function. Each pair of consecutive trees in the sequence is contained in a constrained convex shape Delaunay graph. In addition, we give a linear upper bound and specific bounds when the convex shape is a square. With focus still on convex distance functions, we study Hamiltonicity in k-order convex shape Delaunay graphs. Depending on the convex shape, we provide several upper bounds for the minimum k for which the k-order convex shape Delaunay graph is always Hamiltonian. In addition, we provide lower bounds when the convex shape is in a set of certain regular polygons. Finally, we revisit an affine invariant triangulation, which is a special type of convex shape Delaunay triangulation. We show that many properties of the standard Delaunay triangulations carry over to these triangulations. Also, motivated by this affine invariant triangulation, we study different triangulation methods for producing other affine invariant geometric objects.