Optimal higher order Delaunay triangulations of polygons

Citations of this article
Mendeley users who have this article in their library.


This paper presents an algorithm to triangulate polygons optimally using order-k Delaunay triangulations, for a number of quality measures. The algorithm uses properties of higher order Delaunay triangulations to improve the O(n 3) running time required for normal triangulations to O(k 2nlogk+knlogn) expected time, where n is the number of vertices of the polygon. An extension to polygons with points inside is also presented, allowing to compute an optimal triangulation of a polygon with h≥1 components inside in O(knlogn)+O(k) h+2n expected time. Furthermore, through experimental results we show that, in practice, it can be used to triangulate point sets optimally for small values of k. This represents the first practical result on optimization of higher order Delaunay triangulations for k>1. © 2009 Elsevier B.V. All rights reserved.




Silveira, R. I., & Van Kreveld, M. (2009). Optimal higher order Delaunay triangulations of polygons. In Computational Geometry: Theory and Applications (Vol. 42, pp. 803–813). https://doi.org/10.1016/j.comgeo.2008.02.006

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free