A heuristic triangulation algorithm for multiple planar contours using an extended double branching procedure
- 1 August 1994
- journal article
- Published by Springer Nature in The Visual Computer
- Vol. 10 (7) , 372-387
- https://doi.org/10.1007/bf01900663
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Surfaces from contoursACM Transactions on Graphics, 1992
- Efficient triangulation of simple polygonsThe Visual Computer, 1991
- A triangulation algorithm from arbitrary shaped multiple planar contoursACM Transactions on Graphics, 1991
- The homotopy model: a generalized model for smooth surface generation from cross sectional dataThe Visual Computer, 1991
- A new surface interpolation technique for reconstructing 3D objects from serial cross-sectionsComputer Vision, Graphics, and Image Processing, 1989
- A new general triangulation method for planar contoursACM SIGGRAPH Computer Graphics, 1982
- Surface definition for branching, contour-defined objectsACM SIGGRAPH Computer Graphics, 1981
- Optimal surface reconstruction from planar contoursCommunications of the ACM, 1977
- Approximating Complex Surfaces by Triangulation of Contour LinesIBM Journal of Research and Development, 1975
- An iterative procedure for the polygonal approximation of plane curvesComputer Graphics and Image Processing, 1972