For a set P of points in the plane, we introduce a class of triangulations that is an extension of the Delaunay triangulation. Instead of requiring that for each triangle the circle through its vertices contains no points of P inside, we require that at most k points are inside the circle. Since there are many different higher order Delaunay triangulations for a point set, other useful criteria for triangulations can be incorporated without sacrificing the well-shapedness too much. Applications include realistic terrain modelling, and mesh generation.
CITATION STYLE
Gudmundsson, J., Hammar, M., & Van Kreveld, M. (2000). Higher order Delaunay triangulations. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 1879, 232–243. https://doi.org/10.1007/3-540-45253-2_22
Mendeley helps you to discover research relevant for your work.