Natural surface approximation by constrained surface interpolation
Computer-Aided Design - Digital cartography
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
Voronoi diagrams and Delaunay triangulations
Handbook of discrete and computational geometry
Handbook of discrete and computational geometry
Handbook of discrete and computational geometry
Hierarchical vertical decompositions, ray shooting, and circular arc queries in simple polygons
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
On range reporting, ray shooting and k-level construction
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Planar Drawings and Angular Resolution: Algorithms and Bounds (Extended Abstract)
ESA '94 Proceedings of the Second Annual European Symposium on Algorithms
Almost-Delaunay simplices: nearest neighbor relations for imprecise points
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Constrained higher order Delaunay triangulations
Computational Geometry: Theory and Applications
Generating realistic terrains with higher-order Delaunay triangulations
Computational Geometry: Theory and Applications - Special issue on the 21st European workshop on computational geometry (EWCG 2005)
Constructing minimum-interference networks
Computational Geometry: Theory and Applications
Computational Geometry: Theory and Applications
Towards a definition of higher order constrained Delaunay triangulations
Computational Geometry: Theory and Applications
Optimal higher order Delaunay triangulations of polygons
Computational Geometry: Theory and Applications
Constrained higher order Delaunay triangulations
Computational Geometry: Theory and Applications
Optimization for first order Delaunay triangulations
Computational Geometry: Theory and Applications
Optimal higher order Delaunay triangulations of polygons
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
On crossing numbers of geometric proximity graphs
Computational Geometry: Theory and Applications
On the number of higher order Delaunay triangulations
Theoretical Computer Science
An output-sensitive approach for the L1/L∞k-nearest-neighbor Voronoi diagram
ESA'11 Proceedings of the 19th European conference on Algorithms
A faster circle-sweep Delaunay triangulation algorithm
Advances in Engineering Software
Generating realistic terrains with higher-order delaunay triangulations
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Constructing interference-minimal networks
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
Removing local extrema from imprecise terrains
Computational Geometry: Theory and Applications
On the number of higher order delaunay triangulations
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
Some properties of k-Delaunay and k-Gabriel graphs
Computational Geometry: Theory and Applications
Optimization for first order delaunay triangulations
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Flooding countries and destroying dams
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Fingerprint indexing with bad quality areas
Expert Systems with Applications: An International Journal
Information Processing Letters
| 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 modeling and mesh generation.