Natural surface approximation by constrained surface interpolation
Computer-Aided Design - Digital cartography
Solving query-retrieval problems by compacting Voronoi diagrams
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Spatial tessellations: concepts and applications of Voronoi diagrams
Spatial tessellations: concepts and applications of Voronoi diagrams
Drawing graphs in the plane with high resolution
SIAM Journal on Computing
One strike against the min-max degree triangulation problem
Computational Geometry: Theory and Applications
Algorithms for drawing graphs: an annotated bibliography
Computational Geometry: Theory and Applications
Triangulating planar graphs while minimizing the maximum degree
Information and Computation
Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
Constructing Levels in Arrangements and Higher Order Voronoi Diagrams
SIAM Journal on Computing
Voronoi diagrams and Delaunay triangulations
Handbook of discrete and computational geometry
Handbook of discrete and computational geometry
Planar Drawings and Angular Resolution: Algorithms and Bounds (Extended Abstract)
ESA '94 Proceedings of the Second Annual European Symposium on Algorithms
On k-Nearest Neighbor Voronoi Diagrams in the Plane
IEEE Transactions on Computers
| Hi-index | 0.00 |
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.