Principles of artificial intelligence
Principles of artificial intelligence
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
From contours to surfaces: testbed and initial results
CHI '87 Proceedings of the SIGCHI/GI Conference on Human Factors in Computing Systems and Graphics Interface
Pessimal Guesses may be Optimal: A Counterintuitive Search Result
IEEE Transactions on Pattern Analysis and Machine Intelligence
A triangulation algorithm from arbitrary shaped multiple planar contours
ACM Transactions on Graphics (TOG)
ACM Transactions on Graphics (TOG)
A physically based approach to 2–D shape blending
SIGGRAPH '92 Proceedings of the 19th annual conference on Computer graphics and interactive techniques
Piecewise-linear interpolation between polygonal slices
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
History consideration in reconstructing polyhedral surfaces from parallel slices
Proceedings of the 7th conference on Visualization '96
Multiresolution banded refinement to accelerate surface reconstruction from polygons
Proceedings of the fourteenth annual symposium on Computational geometry
VVS '89 Proceedings of the 1989 Chapel Hill workshop on Volume visualization
SIGGRAPH '88 Proceedings of the 15th annual conference on Computer graphics and interactive techniques
Shape Averaging and it's Applications to Industrial Design
IEEE Computer Graphics and Applications
Tensor Product Surfaces Guided by Minimal Surface Area Triangulations
VIS '95 Proceedings of the 6th conference on Visualization '95
Contour/Surface Registration Using a Physically Deformable Model
MMBIA '96 Proceedings of the 1996 Workshop on Mathematical Methods in Biomedical Image Analysis (MMBIA '96)
Hierarchical triangulation using terrain features
VIS '90 Proceedings of the 1st conference on Visualization '90
Contour interpolation by straight skeletons
Graphical Models
Animating the Human Muscle Structure
Computing in Science and Engineering
Accurate contour plotting using 6-node triangular elements in 2D
Finite Elements in Analysis and Design
3D Object Reconstruction from Parallel Cross-Sections
ICCVG 2008 Proceedings of the International Conference on Computer Vision and Graphics: Revised Papers
Technical section: Fast energy-based surface wrinkle modeling
Computers and Graphics
Static methods for object reconstruction overview: for medical diagnosis
Annales UMCS, Informatica
Reconstruction of multi-label domains from partial planar cross-sections
SGP '09 Proceedings of the Symposium on Geometry Processing
Technical Section: Shape approximation by differential properties of scalar functions
Computers and Graphics
WSEAS Transactions on Signal Processing
Online reconstruction of 3D objects from arbitrary cross-sections
ACM Transactions on Graphics (TOG)
3D image reconstruction of bladder by nonlinear interpolation
Mathematical and Computer Modelling: An International Journal
Hi-index | 0.00 |
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 P0,P1,...Pm−1 and Q0,Q1,...Qn−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.