Layered Depth-Normal Images for Complex Geometries: Part Two — Manifold-Preserved Adaptive Contouring

We present an adaptive contouring approach to generate contour surface from solid models represented by Layered Depth-Normal Images (LDNI) sampled in three orthogonal directions. Our contouring algorithm builds an octree structure for mesh generation in a top-down manner: starting from the bounding box of a LDNI solid model, the cells are recursively subdivided into smaller sub-cells based on the topology and geometry criteria of refinement until both of the requirements, the topology in cell is simple and the geometry approximation error is less than a user defined tolerance, are satisfied. The subdivision also stops when the processed cells reach the finest resolution of LDNI models. In order to overcome the topology ambiguity inside a cell that leads to the occurrence of nonmanifold entities, we analyze the possible inside/outside configurations of cell-nodes and exploit two strategies to generate manifold-preserved mesh surfaces. Moreover, the most time-consuming step of our contouring algorithm – the construction of octree structure can be easily parallelized to run under a computer framework with multiple-processors and shared memory. Several examples have been tested in the paper to demonstrate the success of our method.

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

[2]  Matthias Teschner,et al.  Volumetric Collision Detection for Derformable Objects , 2003 .

[3]  Dinesh Manocha,et al.  Feature-sensitive subdivision and isosurface reconstruction , 2003, IEEE Visualization, 2003. VIS 2003..

[4]  Jai Menon,et al.  On the completeness and conversion of ray representations of arbitrary solids , 1995, Symposium on Solid Modeling and Applications.

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

[6]  Karl Heinz Höhne,et al.  High quality rendering of attributed volume data , 1998 .

[7]  Tao Ju,et al.  Dual contouring of hermite data , 2002, ACM Trans. Graph..

[8]  Dinesh Manocha,et al.  Topology preserving surface extraction using adaptive subdivision , 2004, SGP '04.

[9]  Richard Szeliski,et al.  Layered depth images , 1998, SIGGRAPH.

[10]  Jarek Rossignac,et al.  Solid modeling , 1994, IEEE Computer Graphics and Applications.

[11]  Mario Botsch,et al.  Feature sensitive surface extraction from volume data , 2001, SIGGRAPH.

[12]  Bernd Hamann,et al.  The asymptotic decider: resolving the ambiguity in marching cubes , 1991, Proceeding Visualization '91.

[13]  E. E. Hartquista,et al.  A computing strategy for applications involving offsets , sweeps , and Minkowski operations , 1998 .

[14]  Gregory M. Nielson,et al.  Dual marching cubes , 2004, IEEE Visualization 2004.

[15]  Ming C. Leu,et al.  A Novel Contour Generation Algorithm for Surface Reconstruction From Dexel Data , 2007, J. Comput. Inf. Sci. Eng..

[16]  David W. Rosen,et al.  A Point-Based Offsetting Method of Polygonal Meshes , 2006 .

[17]  Jakob Andreas Bærentzen,et al.  3D distance fields: a survey of techniques and applications , 2006, IEEE Transactions on Visualization and Computer Graphics.

[18]  J. Wilhelms,et al.  Topological considerations in isosurface generation extended abstract , 1990, VVS.

[19]  Scott Schaefer,et al.  Dual Marching Cubes: Primal Contouring of Dual Grids , 2005, Comput. Graph. Forum.

[20]  Thomas Lewiner,et al.  Efficient Implementation of Marching Cubes' Cases with Topological Guarantees , 2003, J. Graphics, GPU, & Game Tools.

[21]  Jarek Rossignac,et al.  Optimizing the topological and combinatorial complexity of isosurfaces , 2005, Comput. Aided Des..

[22]  Charlie C. L. Wang,et al.  Feature-based 3D non-manifold freeform object construction , 2003, Engineering with Computers.

[23]  Charlie C. L. Wang,et al.  Layered Depth-Normal Images: a Sparse Implicit Representation of Solid Models , 2010, ArXiv.

[24]  Charlie C. L. Wang,et al.  Layer Depth-Normal Images for Complex Geometries: Part One — Accurate Modeling and Adaptive Sampling , 2008 .

[25]  Krishnan Suresh,et al.  A computing strategy for applications involving offsets, sweeps, and Minkowski operations , 1999, Comput. Aided Des..

[26]  Yong Chen,et al.  An accurate sampling-based method for approximating geometry , 2007, Comput. Aided Des..

[27]  Gershon Kedem,et al.  The Ray casting engine and Ray representatives , 1991, SMA '91.

[28]  Tao Ju,et al.  Manifold Dual Contouring , 2007, IEEE Transactions on Visualization and Computer Graphics.

[29]  Christoph M. Hoffmann,et al.  Robustness in Geometric Computations , 2001, J. Comput. Inf. Sci. Eng..

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

[31]  Dinesh Manocha,et al.  Fast swept volume approximation of complex polyhedral models , 2003, SM '03.