Abstract
This paper presents a heuristic triangulation algorithm for reconstructing surfaces over a set of cross-sectional contours. The multiple branching problem, an important problem of conventional triangulation methods, is reated as a set of double branchings, and an algorithm based on countour merging is developed. Several imaginary contours are generated to handle the multiple branching problem with many branch contours. A double branching algorithm based on the partitioning of the root contour is also proposed. The results show that our method works well even for objects with many complicated branches.
Similar content being viewed by others
References
Boissonat JD (1985) Surface reconstruction from planar cross-sections. Proc IEEE Conference on Computer Vision and Pattern Recognition, pp 393–397
Christiansen HN, Sederberg TW (1978) Conversion of complex contour line definition into polygonal element mosaics. Comput Graph 20:693–702
Cook PN, Batnitsky S (1981) Three-dimensional reconstruction from serial serial sections for medical applications. 14th International Conference on System Science pp 358–389
Ekoule AB, Peyrin F, Odet CL (1991) A triangulation algorithm from arbitrary shaped multiple planar contours. ACM Trans Graph 10:182–199
Fuchs H, Kedem ZM, Uselton SP (1977) Optimal surface reconstruction from planar contours. Commun ACM 20:693–702
Ganapathy S, Dennehy TG (1982) A new general triangulation method for planar contours. Comput Graph 16:69–75
Keppel E (1975) Approximating complex suraces by triangulation of contour lines. IBM J Res Devel 19:2–11
Lee DT (1982) Medial axis transformation of a planar shape. IEEE Trans. Pattern Analysis Machine Intelligence 4:363–369
Lin WC, Chen SY, Chen CT (1989) A new surface interpolation technique for reconstructing 3d objects from serial cross-sections. Comput Vision, Graphics, Image Proceesing 48:124–143
Meyers D, Skinner S, Sloan K (1992) Surfaces from contours. ACM Trans Graph 11:228–258
Preparata EP, Shamos MI (1987) Computational Geometry, An Introduction. Springer, Berlin Heidelberg New York
Ramer U (1972) An iterative procedure for the polygonal aporximation of plane curves. Comput Graph Image Processing 1:244–256
Szhantz M (1981) Surface definition for branching contour defined objects. Scomput Graph 15:242–270
Shinagawa Y, Kunii TL (1991a) constructing a reeb graph automatically from cross sections. IEEE Comput Graph Appl 11:44–51
Shinagawa Y, Kunii TL (1991b) The homotopy model: a generalized model for smooth surface generation from cross sectional data. Visual Comput 7:72–86
Shinagawa Y, Kergosien L, Kunii TL (1991) Surface coding based on morse theory. IEEE Comput Graph Appl 11:66–78
Shirai Y (1987) Three-dimensional computer vision. Springer, Berlin Heidelberg New York
Toussaint G (1991) Efficient triangulation of simple polygons. Visual Comput 7:280–295
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Choi, YK., Park, K.H. A heuristic triangulation algorithm for multiple planar contours using an extended double branching procedure. The Visual Computer 10, 372–387 (1994). https://doi.org/10.1007/BF01900663
Issue Date:
DOI: https://doi.org/10.1007/BF01900663