An on-line algorithm for constrained Delaunay triangulation
- 31 July 1992
- journal article
- Published by Elsevier in CVGIP: Graphical Models and Image Processing
- Vol. 54 (4) , 290-300
- https://doi.org/10.1016/1049-9652(92)90076-a
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Applications of random sampling in computational geometry, IIDiscrete & Computational Geometry, 1989
- Shape reconstruction from planar cross sectionsComputer Vision, Graphics, and Image Processing, 1988
- On Constructing Delaunay Triangulations for Sets Constrained by Line SegmentsPublished by National Institute of Standards and Technology (NIST) ,1988
- Visibility of disjoint polygonsAlgorithmica, 1986
- Delaunay-based representation of surfaces defined over arbitrarily shaped domainsComputer Vision, Graphics, and Image Processing, 1985
- Geometric structures for three-dimensional shape representationACM Transactions on Graphics, 1984
- Automatic extraction of Irregular Network digital terrain modelsACM SIGGRAPH Computer Graphics, 1979
- On the Angle Condition in the Finite Element MethodSIAM Journal on Numerical Analysis, 1976
- Automatic triangulation of arbitrary planar domains for the finite element methodInternational Journal for Numerical Methods in Engineering, 1974
- Triangular elements in the finite element methodMathematics of Computation, 1970