Optimal higher order Delaunay triangulations of polygons
From MaRDI portal
Publication:1028236
DOI10.1016/j.comgeo.2008.02.006zbMath1167.65345OpenAlexW2109498180MaRDI QIDQ1028236
Rodrigo I. Silveira, Marc J. van Kreveld
Publication date: 30 June 2009
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2008.02.006
Cites Work
- Unnamed Item
- Generating realistic terrains with higher-order Delaunay triangulations
- Towards a definition of higher order constrained Delaunay triangulations
- Constrained Delaunay triangulations
- Higher order Delaunay triangulations
- Constrained higher order Delaunay triangulations
- The greedy triangulation can be computed from the Delaunay triangulation in linear time
- Edge insertion for optimal triangulations
- Algorithms for optimal area triangulations of a convex polygon
- Delaunay-based representation of surfaces defined over arbitrarily shaped domains
- Delaunay configurations and multivariate splines: A generalization of a result of B. N. Delaunay
- Optimization for First Order Delaunay Triangulations
- Storing a Sparse Table with 0 (1) Worst Case Access Time
- Minimal Triangulations of Polygonal Domains
- A Quadratic Time Algorithm for the Minmax Length Triangulation
- An optimal algorithm for intersecting line segments in the plane
- A Pedestrian Approach to Ray Shooting: Shoot a Ray, Take a Walk
- Augmenting Outerplanar Graphs
- SOFSEM 2006: Theory and Practice of Computer Science
