Constrained delaunay triangulations
- 1 June 1989
- journal article
- Published by Springer Nature in Algorithmica
- Vol. 4 (1-4) , 97-108
- https://doi.org/10.1007/bf01553881
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- A sweepline algorithm for Voronoi diagramsAlgorithmica, 1987
- Generalized delaunay triangulation for planar graphsDiscrete & Computational Geometry, 1986
- There is a planar graph almost as good as the complete graphPublished by Association for Computing Machinery (ACM) ,1986
- Delaunay-based representation of surfaces defined over arbitrarily shaped domainsComputer Vision, Graphics, and Image Processing, 1985
- Computational GeometryPublished by Springer Nature ,1985
- Voronoi diagrams based on convex distance functionsPublished by Association for Computing Machinery (ACM) ,1985
- Two algorithms for constructing a Delaunay triangulationInternational Journal of Parallel Programming, 1980
- Efficient computation of continuous skeletonsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1979