Control of Polygonal Mesh Resolution for 3-D Computer Vision

A common representation in 3-D computer vision is the polygonal surface mesh because meshes can model objects of arbitrary shape and are easily constructed from sensed 3-D data. The resolution of a surface mesh is the overall spacing between vertices that comprise the mesh. Because sensed 3-D points are often unevenly distributed, the resolution of a surface mesh is often poorly defined. We present an algorithm that transforms a mesh with an uneven spacing between vertices into a mesh with a more even spacing between vertices, thus improving its definition of resolution. In addition, we show how the algorithm can be used to control the resolution of surface meshes, making them amenable to multiresolution approaches in computer vision. The structure of our algorithm is modeled on iterative mesh simplification algorithms common in computer graphics; however, the individual steps in our algorithm are designed specifically to control mesh resolution. An even spacing between vertices is generated by applying a sequence of local edge operations that promote uniform edge lengths while preserving mesh shape. To account for polyhedral objects, we introduce an accurate shape change measure that permits edge operations along sharp creases. By locally bounding the total change in mesh shape, drastic changes in global shape are prevented. We show results from many 3-D sensing domains including computed tomography, range imaging, and digital elevation map construction.

[1]  Paul S. Heckbert,et al.  Survey of Polygonal Surface Simplification Algorithms , 1997 .

[2]  Demetri Terzopoulos,et al.  Sampling and reconstruction with adaptive meshes , 1991, Proceedings. 1991 IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[3]  Anil K. Jain,et al.  BONSAI: 3D Object Recognition Using Constrained Search , 1990, IEEE Trans. Pattern Anal. Mach. Intell..

[4]  Charles D. Hansen,et al.  Geometric optimization , 1993, Proceedings Visualization '93.

[5]  Gérard G. Medioni,et al.  Structural Indexing: Efficient 3-D Object Recognition , 1992, IEEE Trans. Pattern Anal. Mach. Intell..

[6]  Ruzena Bajcsy,et al.  Spline Representations in 3-D Vision , 1994, Object Representation in Computer Vision.

[7]  Mark D. Wheeler,et al.  Automatic Modeling and Localization for Object Recognition , 1996 .

[8]  Tony DeRose,et al.  Mesh optimization , 1993, SIGGRAPH.

[9]  Dinesh Manocha,et al.  Simplification envelopes , 1996, SIGGRAPH.

[10]  William E. Lorensen,et al.  Decimation of triangle meshes , 1992, SIGGRAPH.

[11]  Paul S. Heckbert,et al.  Using particles to sample and control implicit surfaces , 1994, SIGGRAPH.

[12]  Greg Turk,et al.  Re-tiling polygonal surfaces , 1992, SIGGRAPH.

[13]  Demetri Terzopoulos,et al.  Adaptive meshes and shells: irregular triangulation, discontinuities, and hierarchical subdivision , 1992, Proceedings 1992 IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[14]  Andrew E. Johnson,et al.  Surface registration by matching oriented points , 1997, Proceedings. International Conference on Recent Advances in 3-D Digital Imaging and Modeling (Cat. No.97TB100134).

[15]  Hugues Hoppe,et al.  Progressive meshes , 1996, SIGGRAPH.

[16]  Michael Garland,et al.  Surface simplification using quadric error metrics , 1997, SIGGRAPH.

[17]  Tony DeRose,et al.  Multiresolution analysis of arbitrary meshes , 1995, SIGGRAPH.

[18]  Thomas Ertl,et al.  Computer Graphics - Principles and Practice, 3rd Edition , 2014 .

[19]  M. Carter Computer graphics: Principles and practice , 1997 .

[20]  Subhash Suri,et al.  Surface approximation and geometric partitions , 1994, SODA '94.

[21]  Russell H. Taylor,et al.  Superfaces: polyhedral approximation with bounded error , 1994, Medical Imaging.