A triangulation algorithm from arbitrary shaped multiple planar contours
ACM Transactions on Graphics (TOG)
Piecewise-linear interpolation between polygonal slices
Computer Vision and Image Understanding
Arbitrary topology shape reconstruction from planar cross sections
Graphical Models and Image Processing
Shape transformation using variational implicit functions
Proceedings of the 26th annual conference on Computer graphics and interactive techniques
Optimal surface reconstruction from planar contours
Communications of the ACM
Conversion of complex contour line definitions into polygonal element mosaics
SIGGRAPH '78 Proceedings of the 5th annual conference on Computer graphics and interactive techniques
| Hi-index | 0.00 |
A new mesh reconstruction technique, called dividing virtual belt algorithm (DVBA), is proposed for approximating the surface from a set of wire-frame contours. DVBA decomposes the branching region into a set of virtual belts and virtual canyons. A tiling technique based on the divide-and-conquer strategy is also introduced to approximate the surface from the virtual belt, and the virtual canyons are covered by a conventional polygon triangulation technique. The experimental result shows that our method works well even though there are many complicated branches in the object.