Higher Order Delaunay Triangulations

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.

[1]  David Eppstein,et al.  Triangulating polygons without large angles , 1995, Int. J. Comput. Geom. Appl..

[2]  Roberto Tamassia,et al.  Planar Drawings and Angular Resolution: Algorithms and Bounds (Extended Abstract) , 1994, ESA.

[3]  David M. Mark,et al.  Part 4: Mathematical, Algorithmic and Data Structure Issues: Automated Detection Of Drainage Networks From Digital Elevation Models , 1984 .

[4]  F. Leighton,et al.  Drawing graphs in the plane with high resolution , 1993 .

[5]  Michael F. Goodchild,et al.  GIS and hydrologic modeling. , 1993 .

[6]  Alok Aggarwal,et al.  Solving query-retrieval problems by compacting Voronoi diagrams , 1990, STOC '90.

[7]  David Eppstein,et al.  MESH GENERATION AND OPTIMAL TRIANGULATION , 1992 .

[8]  D. T. Lee,et al.  An Optimal Illumination Region Algorithm for Convex Polygons , 1982, IEEE Transactions on Computers.

[9]  Ioannis G. Tollis,et al.  Algorithms for Drawing Graphs: an Annotated Bibliography , 1988, Comput. Geom..

[10]  Klaus Jansen.  One Strike Against the Min-max Degree Triangulation Problem , 1992, Comput. Geom..

[11]  Bianca Falcidieno,et al.  Natural surface approximation by constrained stochastic interpolation , 1990, Comput. Aided Des..

[12]  Goos Kant,et al.  Triangulating Planar Graphs while Minimizing the Maximum Degree , 1992, Inf. Comput..

[13]  Edgar A. Ramos,et al.  On range reporting, ray shooting and k-level construction , 1999, SCG '99.

[14]  Atsuyuki Okabe,et al.  Spatial Tessellations: Concepts and Applications of Voronoi Diagrams , 1992, Wiley Series in Probability and Mathematical Statistics.

[15]  D. T. Lee,et al.  On k-Nearest Neighbor Voronoi Diagrams in the Plane , 1982, IEEE Transactions on Computers.

[16]  James J. Little,et al.  Structural Lines, TINs, and DEMs , 2001, Algorithmica.

[17]  Hazel Everett,et al.  Hierarchical vertical decompositions, ray shooting, and circular arc queries in simple polygons , 1999, SCG '99.

[18]  Mark de Berg,et al.  Computational geometry: algorithms and applications , 1997 .