Affiliation:
1. Ultrasonic Imaging Laboratory, Department of Electrical and Computer Engineering, University of Michigan
Abstract
The problem of approximating the surface spanning a given set of 3D points as a polyhedron of triangular faces (“triangulation”) is a significant one, and has many applications in the fields of computer graphics and computer vision. In this paper, several solutions to this problem are reviewed. These solutions can be grouped into two classes, and particular emphasis is given to the class of surfaces spanned by parallel planar contours. For a contour pair
P
0
,P
1
,...P
m−1
and
Q
0
,Q
1
,...Q
n−1
, a graph theoretic approach can be used to arrive at a class of solutions, each requiring exactly
m+n
steps to triangulate the pair. Existing methods (both rigorous and heuristic) for extracting a particular solution from this group are reviewed, and a new heuristic based on inter-contour coherence is proposed. This heuristic is being used in the field of Ultrasonic Non-destructive Evaluation to produce images of flaws in pressure vessels, and its performance is shown to compare favorably with methods of greater computational complexity. It is believed that this heuristic can also be used with success in industrial vision systems where similar contours are obtained using a laser range finder.
Publisher
Association for Computing Machinery (ACM)
Subject
Computer Graphics and Computer-Aided Design,General Computer Science
Reference7 articles.
1. Boissonnat J.D. and Faugeras O.D. "Triangulation of 3D Objects " PROCEEDINGS OF THE 1981 INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE 658-660. Boissonnat J.D. and Faugeras O.D. "Triangulation of 3D Objects " PROCEEDINGS OF THE 1981 INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE 658-660.
2. O'Roarke Joseph "Triangulation of Minimal Area as 3D Object Models " PROCEEDINGS OF THE 1981 INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE 664-666. O'Roarke Joseph "Triangulation of Minimal Area as 3D Object Models " PROCEEDINGS OF THE 1981 INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE 664-666.
3. Optimal surface reconstruction from planar contours
4. Approximating Complex Surfaces by Triangulation of Contour Lines
5. Conversion of complex contour line definitions into polygonal element mosaics
Cited by
94 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献