DocumentCode
304745
Title
Mesh integration based on co-measurements
Author
Pito, Richard
Author_Institution
Dept. of Comput. & Inf. Sci., Pennsylvania Univ., Philadelphia, PA, USA
Volume
1
fYear
1996
fDate
16-19 Sep 1996
Firstpage
397
Abstract
An algorithm for the integration of meshes derived from range data is presented. All of the triangles from either mesh which have sampled the same surface patch of the object are identified as co-measurements and only the most confidently acquired one is kept. Co-measurement identification is based on the position and orientation of the range scanner when each triangle was sampled. Once the redundant triangles have been removed what remains is a patchwork of unconnected non-intersecting meshes which cover the sampled areas of the object. Neighborhood relationships established between the edge points of each patch are used to seam them together. The final mesh is guaranteed to be plausible in the sense that each triangle represents a surface which could have been scanned given the positions and orientations of the range scanner and 2-manifold with the exception that a vertex may be incident to two triangles that are connected only through that vertex. The algorithm performs equally well in areas of low and high curvature
Keywords
distance measurement; edge detection; image sampling; 2-manifold; comeasurement identification; edge points; high curvature areas; low curvature areas; mesh integration algorithm; neighborhood relationships; range data; range scanner orientation; range scanner position; redundant triangles; surface patch; triangles; Contracts; Geometry; Heuristic algorithms; Image sampling; Inference algorithms; Information science; Laboratories; Noise robustness; Subcontracting; Topology;
fLanguage
English
Publisher
ieee
Conference_Titel
Image Processing, 1996. Proceedings., International Conference on
Conference_Location
Lausanne
Print_ISBN
0-7803-3259-8
Type
conf
DOI
10.1109/ICIP.1996.560846
Filename
560846
Link To Document