Marching intersections: an efficient resampling algorithm for surface management

The paper presents a simple and efficient algorithm for the removal of small topological inconsistencies and high frequency details from surface models. The method, called marching intersections (MI), adopts a volumetric approach and acts as a resampling filter. All the intersection points between the input model and the lines of a user selected 3D reference grid are located and then, beginning from these intersections, an output surface is reconstructed. MI, which presents good characteristics in terms of efficiency, compactness, and quality of the output models, can be also used: for the conversion between different representation schemes; to perform logical operations on geometric models; for the topological simplification of surfaces; and for the simplification of huge meshes, i.e. meshes too large to be allocated in main memory during the simplification process. All these aspects are discussed in the paper and timing and graphic results are presented.

[1]  William E. Lorensen,et al.  Marching cubes: A high resolution 3D surface construction algorithm , 1987, SIGGRAPH.

[2]  Arie E. Kaufman,et al.  Efficient algorithms for scan-converting 3D polygons , 1988, Comput. Graph..

[3]  Andrew S. Glassner,et al.  An introduction to ray tracing , 1989 .

[4]  Roberto Scopigno,et al.  QUADTREE / OCTREE- TO-BOUNDARY CONVERSION , 1991 .

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

[6]  Herbert Edelsbrunner,et al.  Three-dimensional alpha shapes , 1992, VVS.

[7]  Jarek Rossignac,et al.  Multi-resolution 3D approximations for rendering complex scenes , 1993, Modeling in Computer Graphics.

[8]  Edwin H. Blake,et al.  The Mesh Propagation Algorithm for Isosurface Construction , 1994, Comput. Graph. Forum.

[9]  D. Manocha,et al.  Fast Polygon Triangulation Based on Seidel's Algorithm , 1995 .

[10]  Marc Levoy,et al.  A volumetric method for building complex models from range images , 1996, SIGGRAPH.

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

[12]  Amitabh Varshney,et al.  Controlled Topology Simplification , 1996, IEEE Trans. Vis. Comput. Graph..

[13]  Enrico Puppo,et al.  Simplification, LOD and MultiresolutionPrinciples and Applications , 1997, Eurographics.

[14]  William J. Schroeder.  A topology modifying progressive decimation algorithm , 1997 .

[15]  William Schroeder,et al.  The Visualization Toolkit: An Object-Oriented Approach to 3-D Graphics , 1997 .

[16]  Jihad El-Sana,et al.  Topology Simplification for Polygonal Virtual Environments , 1998, IEEE Trans. Vis. Comput. Graph..

[17]  Subodh Kumar,et al.  RSVP: A Geometric Toolkit for Controlled Repair of Solid Models , 1998, IEEE Trans. Vis. Comput. Graph..

[18]  William E. Lorensen,et al.  The visualization toolkit (2nd ed.): an object-oriented approach to 3D graphics , 1998 .

[19]  Paolo Cignoni,et al.  Metro: Measuring Error on Simplified Surfaces , 1998, Comput. Graph. Forum.

[20]  Michael Garland,et al.  Multiresolution Modeling: Survey and Future Opportunities , 1999, Eurographics.

[21]  Heinrich Müller,et al.  Improved Laplacian Smoothing of Noisy Surface Meshes , 1999, Comput. Graph. Forum.

[22]  M. Garland,et al.  Multiresolution Modeling: Survey & Future Opportunities , 1999 .

[23]  Pere Brunet,et al.  Validity-Preserving Simplification of Very Complex Polyhedral Solids , 1999, EGVE.

[24]  Nicholas Kalouptsidis,et al.  Efficient Algorithms for , 1999 .

[25]  Ronald N. Perry,et al.  Adaptively sampled distance fields: a general representation of shape for computer graphics , 2000, SIGGRAPH.

[26]  Peter Lindstrom,et al.  Out-of-core simplification of large polygonal models , 2000, SIGGRAPH.

[27]  Paolo Cignoni,et al.  External Memory Management and Simplification of Huge Meshes , 2003, IEEE Trans. Vis. Comput. Graph..

[28]  Paolo Cignoni,et al.  The Marching Intersections algorithm for merging range images , 2003, The Visual Computer.