Optimal Higher Order Delaunay Triangulations of Polygons

Abstract

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) running time required for normal triangulations to O(kn log k + kn log n) expected time, where n is the number of vertices of the… (More)
DOI: 10.1007/978-3-540-78773-0_12

Topics

10 Figures and Tables

Slides referencing similar topics