A fast algorithm for generating constrained delaunay triangulations
- 1 May 1993
- journal article
- Published by Elsevier in Computers & Structures
- Vol. 47 (3), 441-450
- https://doi.org/10.1016/0045-7949(93)90239-a
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- The integrity of geometrical boundaries in the two-dimensional delaunay triangulationCommunications in Applied Numerical Methods, 1990
- Delaunay triangulation of non‐convex planar domainsInternational Journal for Numerical Methods in Engineering, 1989
- Geometry‐based fully automatic mesh generation and the delaunay triangulationInternational Journal for Numerical Methods in Engineering, 1988
- A fast algorithm for constructing Delaunay triangulations in the planeAdvances in Engineering Software (1978), 1987
- Delaunay-based representation of surfaces defined over arbitrarily shaped domainsComputer Vision, Graphics, and Image Processing, 1985
- Algorithm 624: Triangulation and Interpolation at Arbitrarily Distributed Points in the PlaneACM Transactions on Mathematical Software, 1984
- An implementation of Watson's algorithm for computing 2-dimensional delaunay triangulationsAdvances in Engineering Software (1978), 1984
- A storage-efficient method for construction of a Thiessen triangulationRocky Mountain Journal of Mathematics, 1984
- Computing the n-dimensional Delaunay tessellation with application to Voronoi polytopesThe Computer Journal, 1981
- Two algorithms for constructing a Delaunay triangulationInternational Journal of Parallel Programming, 1980