Bounding proxies for shape approximation

Many computer graphics applications use simpler yet faithful approximations of complex shapes to conduct reliably part of their computations. Some tasks, such as physical simulation, collision detection, occlusion queries or free-form deformation, require the simpler proxy to strictly enclose the input shape. While there are algorithms that can output such bounding proxies on simple input shapes, most of them fail at generating a proper coarse approximant on real-world complex shapes, which may contain multiple components and have a high genus. We advocate that, before reducing the number of primitives to describe a shape, one needs to regularize it while maintaining the strict enclosing property, to avoid any geometric aliasing that makes the decimation unreliable. Depending on the scale of the desired approximation, the topology of the shape itself may indeed have to be first simplified, to let the subsequent geometric optimization be free from topological locks. We propose a new bounding shape approximation algorithm which takes as input an arbitrary surface mesh, with potentially complex multi-component structures, and generates automatically a bounding proxy which is tightened on the input and can match even the coarsest levels of approximation. To sustain the nonlinear approximation process that may eventually abstract both geometry and topology, we propose to use an intermediate regularized representation in the form of a shape closing, computed in real time using a new fast morphological framework designed for efficient parallel execution. Once the desired level of approximation is reached in the shape closing, a coarse, tight and bounding polygonization of the proxy geometry is extracted using an adaptive meshing scheme. Our underlying representation is both geometry- and topology-adaptive and can be optionally controlled accurately by a user, through sizing and orientation fields, yielding an intuitive brush metaphor within an interactive proxy design environment. We provide extensive experiments on various kinds of input meshes and illustrate the potential applications of our method in scenarios that benefit greatly from coarse, tight bounding substitutes to the actual high resolution geometry of the original 3D model, including freeform deformation, physical simulation and level of detail generation for rendering.

[1]  Tamy Boubekeur,et al.  VoxMorph: 3-scale freeform deformation of large voxel grids , 2012, Comput. Graph..

[2]  Niloy J. Mitra,et al.  Abstraction of man-made shapes , 2009, ACM Trans. Graph..

[3]  Zhigang Deng,et al.  Interactive cage generation for mesh deformation , 2017, I3D.

[4]  James F. O'Brien,et al.  Interpolating and approximating implicit surfaces from polygon soup , 2004, SIGGRAPH Courses.

[5]  Marco Attene,et al.  A lightweight approach to repairing digitized polygon meshes , 2010, The Visual Computer.

[6]  Michael Werman,et al.  Computing 2-D Min, Median, and Max Filters , 1993, IEEE Trans. Pattern Anal. Mach. Intell..

[7]  Tamy Boubekeur,et al.  Sphere-Meshes , 2013, ACM Trans. Graph..

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

[9]  Pierre Alliez,et al.  Variational shape approximation , 2004, ACM Trans. Graph..

[10]  Daniele Panozzo,et al.  Practical quad mesh simplification , 2010, Comput. Graph. Forum.

[11]  G. Jagannathan,et al.  A Novel Open Source Morphology Using GPU Processing With LTU-CUDA , 2014 .

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

[13]  Matthew J. Thurley,et al.  Fast Morphological Image Processing Open-Source Extensions for GPU Processing With CUDA , 2012, IEEE Journal of Selected Topics in Signal Processing.

[14]  Mohamed A. Deriche,et al.  Scale-Space Properties of the Multiscale Morphological Dilation-Erosion , 1996, IEEE Trans. Pattern Anal. Mach. Intell..

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

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

[17]  Alec Jacobson,et al.  Nested cages , 2015, ACM Trans. Graph..

[18]  Ken Museth,et al.  VDB: High-resolution sparse volumes with dynamic topology , 2013, TOGS.

[19]  Dan Schonfeld,et al.  Theoretical Foundations of Spatially-Variant Mathematical Morphology Part I: Binary Images , 2008, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[20]  Olivier Cuisenaire Locally adaptable mathematical morphology using distance transformations , 2006, Pattern Recognit..

[21]  Marcel van Herk A fast algorithm for local minimum and maximum filters on rectangular and octagonal kernels , 1992, Pattern Recognit. Lett..

[22]  Tao Ju,et al.  Mean value coordinates for closed triangular meshes , 2005, ACM Trans. Graph..

[23]  Zheng-Jie Deng,et al.  Automatic Cage Building with Quadric Error Metrics , 2011, Journal of Computer Science and Technology.

[24]  Hongwei Lin,et al.  Automatic generation of coarse bounding cages from dense meshes , 2009, 2009 IEEE International Conference on Shape Modeling and Applications.

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

[26]  Hugues Talbot,et al.  Mathematical Morphology: from theory to applications , 2013 .

[27]  Jean Serra,et al.  Image Analysis and Mathematical Morphology , 1983 .

[28]  Pierre Alliez,et al.  Isotopic approximation within a tolerance volume , 2015, ACM Trans. Graph..

[29]  Michael Garland,et al.  Permission grids: practical, error-bounded simplification , 2002, TOGS.

[30]  Pierre Soille,et al.  Recursive Implementation of Erosions and Dilations Along Discrete Lines at Arbitrary Angles , 1996, IEEE Trans. Pattern Anal. Mach. Intell..

[31]  Daniel Cohen-Or,et al.  Green Coordinates , 2008, ACM Trans. Graph..

[32]  Dominique Houzet,et al.  Investigating performance variations of an optimized GPU-ported granulometry algorithm , 2012, Proceedings of the 2012 Conference on Design and Architectures for Signal and Image Processing.

[33]  Tamy Boubekeur,et al.  Morton integrals for high speed geometry simplification , 2015, HPG '15.

[34]  David G. Kirkpatrick,et al.  On the shape of a set of points in the plane , 1983, IEEE Trans. Inf. Theory.

[35]  Mark Meyer,et al.  Harmonic coordinates for character articulation , 2007, ACM Trans. Graph..

[36]  Leif Kobbelt,et al.  Extraction of feature lines on triangulated surfaces using morphological operators , 2000 .

[37]  Alec Jacobson,et al.  Skinning: real-time shape deformation , 2014, SIGGRAPH ASIA Courses.

[38]  Hongwei Lin,et al.  Automatic cage generation by improved OBBs for mesh deformation , 2011, The Visual Computer.

[39]  Olga Sorkine-Hornung,et al.  Consistent Volumetric Discretizations Inside Self‐Intersecting Surfaces , 2013, SGP '13.

[40]  Ron Kimmel,et al.  Efficient Dilation, Erosion, Opening, and Closing Algorithms , 2002, IEEE Trans. Pattern Anal. Mach. Intell..

[41]  Ken Museth,et al.  A Spatially Adaptive Morphological Filter for Dual-Resolution Interface Tracking of Fluids , 2010, Eurographics.

[42]  Viktor Öwall,et al.  Binary Morphology With Spatially Variant Structuring Elements: Algorithm and Architecture , 2009, IEEE Transactions on Image Processing.

[43]  Hans-Peter Seidel,et al.  Fast parallel surface and solid voxelization on GPUs , 2010, SIGGRAPH 2010.

[44]  Tamy Boubekeur,et al.  Point morphology , 2014, ACM Trans. Graph..

[45]  Pedro V. Sander,et al.  Silhouette clipping , 2000, SIGGRAPH.

[46]  Thomas Ertl,et al.  Accelerating Morphological Analysis with Graphics Hardware , 2000, VMV.

[47]  Ron Kimmel,et al.  Efficient Dilation, Erosion, Opening and Closing Algorithms , 2000, ISMM.

[48]  Craig Gotsman,et al.  Spatial deformation transfer , 2009, SCA '09.

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