A heuristic triangulation algorithm for multiple planar contours using an extended double branching procedure

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. © 1994 Springer-Verlag.