skip to main content
research-article

Bounding proxies for shape approximation

Published: 20 July 2017 Publication History

Abstract

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.

Supplementary Material

ZIP File (a57-calderon.zip)
Supplemental files.
MP4 File (papers-0599.mp4)

References

[1]
Marco Attene. 2010. A Lightweight Approach to Repairing Digitized Polygon Meshes. Vis. Comput. 26, 11 (2010), 1393--1406.
[2]
Mirela Ben-Chen, Ofir Weber, and Craig Gotsman. 2009. Spatial Deformation Transfer. In Proc. SCA. 67--74.
[3]
N. Bouaynaya, M. Charif-Chefchaouni, and D. Schonfeld. 2008. Theoretical Foundations of Spatially-Variant Mathematical Morphology Part I: Binary Images. Pattern Analysis and Machine Intelligence, IEEE Transactions on 30, 5 (2008), 823--836.
[4]
V. Boulos, V. Fristot, D. Houzet, L. Salvo, and P. Lhuissier. 2012. Investigating performance variations of an optimized GPU-ported granulometry algorithm. In Design and Architectures for Signal and Image Processing (DASIP). 1--6.
[5]
Stephane Calderon and Tamy Boubekeur. 2014. Point Morphology. ACM Trans. Graph. 33, 4 (2014), 45:1--45:13.
[6]
Jonathan Cohen, Amitabh Varshney, Dinesh Manocha, Greg Turk, Hans Weber, Pankaj Agarwal, Frederick Brooks, and William Wright. 1996. Simplification Envelopes. In Proc. SIGGRAPH. 119--128.
[7]
David Cohen-Steiner, Pierre Alliez, and Mathieu Desbrun. 2004. Variational Shape Approximation. In Proc. SIGGRAPH. 905--914.
[8]
Olivier Cuisenaire. 2006. Locally adaptable mathematical morphology using distance transformations. Pattern Recognition 39, 3 (2006), 405 -- 416.
[9]
Zheng-Jie Deng, Xiao-Nan Luo, and Xiao-Ping Miao. 2011. Automatic Cage Building with Quadric Error Metrics. Journal of Computer Science and Technology 26, 3 (2011), 538--547.
[10]
H. Edelsbrunner, D. Kirkpatrick, and R. Seidel. 1983. On the shape of a set of points in the plane. IEEE Transactions on Information Theory 29, 4 (1983), 551--559.
[11]
Jihad El-Sana and Amitabh Varshney. 1998. Topology Simplification for Polygonal Virtual Environments. IEEE Trans. Vis. Comput. Graph. 4 (1998), 133--144.
[12]
Noura Faraj, Jean-Marc Thiery, and Tamy Boubekeur. 2012. VoxMorph: 3-scale Freeform Deformation of Large Voxel Grids. Comput. & Graph. 36, 5 (aug 2012), 562--568.
[13]
Michael Garland and Paul S. Heckbert. 1997. Surface Simplification Using Quadric Error Metrics. In Proc. SIGGRAPH. 209--216.
[14]
J. Gil and M. Werman. 1993. Computing 2-D min, median, and max filters. Pattern Analysis and Machine Intelligence, IEEE Transactions on 15, 5 (1993), 504--507.
[15]
Joseph (Yossi) Gil and Ron Kimmel. 2002. Efficient Dilation, Erosion, Opening, and Closing Algorithms. IEEE Trans. Pattern Anal. Mach. Intell. 24, 12 (2002), 1606--1617.
[16]
H. Hedberg, P. Dokladal, and V. Öwall. 2009. Binary Morphology With Spatially Variant Structuring Elements: Algorithm and Architecture. Image Processing, IEEE Transactions on 18, 3 (2009), 562--572.
[17]
Matthias Hopf and Thomas Ertl. 2000. Accelerating Morphological Analysis with Graphics Hardware. In Proc. Workshop on Vision, Modelling, and Visualization VMV fi00. 337--345.
[18]
Hugues Hoppe, Tony DeRose, Tom Duchamp, John McDonald, and Werner Stuetzle. 1993. Mesh optimization. In Proc. SIGGRAPH 19--26.
[19]
Paul T. Jackway and Mohamed Deriche. 1996. Scale-Space Properties of the Multiscale Morphological Dilation-Erosion. IEEE Trans. Pattern Anal. Mach. Intell. 18, 1 (1996), 38--51.
[20]
Alec Jacobson, Zhigang Deng, Ladislav Kavan, and JP Lewis. 2014. Skinning: Real-time Shape Deformation. In ACM SIGGRAPH Courses.
[21]
G Jagannathan, R Subash, and K Senthil Raja. 2014. A Novel Open Source Morphology Using GPU Processing With LTU-CUDA. International Journal for Advance Research in Engineering and Technology 2, 1 (2014).
[22]
Pushkar Joshi, Mark Meyer, Tony DeRose, Brian Green, and Tom Sanocki. 2007. Harmonic Coordinates for Character Articulation. ACM Trans. Graph. 26, 3, Article 71 (2007).
[23]
T. Ju, S. Schaefer, and J. Warren. 2005. Mean value coordinates for closed triangular meshes. ACM Trans. Graph. 24, 3 (2005), 561--566.
[24]
B. Le and Z. Deng. 2017. Interactive Cage Generation for Mesh Deformation. In Proc. of ACM SIGGRAPH Symposium on Interactive 3D Graphics and Games (SI3D). 3:1--3:9.
[25]
Hélène Legrand and Tamy Boubekeur. 2015. Morton Integrals for High Speed Geometry Simplification. In Proc. ACM SIGGRAPH/EUROGRAPHICS High-Performance Graphics. 105--112.
[26]
Peter Lindstrom. 2000. Out-of-core simplification of large polygonal models. In Proc. SIGGRAPH. 259--262.
[27]
Y. Lipman, D. Levin, and D. Cohen-Or. 2008. Green coordinates. ACM Trans. Graph. 27, 3 (2008), 1--10.
[28]
Manish Mandad, David Cohen-Steiner, and Pierre Alliez. 2015. Isotopic Approximation Within a Tolerance Volume. ACM Trans. Graph. 34, 4 (2015), 64:1--64:12.
[29]
Ravish Mehra, Qingnan Zhou, Jeremy Long, Alla Sheffer, Amy Gooch, and Niloy J. Mitra. 2009. Abstraction of Man-made Shapes. ACM Trans. Graph. 28, 5 (2009), 137:1--137:10.
[30]
Ken Museth. 2013. VDB: High-resolution Sparse Volumes with Dynamic Topology. ACM Trans. Graph. 32, 3 (2013), 27:1--27:22.
[31]
Laurent Najman and Hugues Talbot (Eds.). 2010. Mathematical Morphology: From Theory to Applications. Wiley.
[32]
Jarek Rossignac and Paul Borrel. 1993. Multi-resolution 3D approximations for rendering complex scenes. In Modeling in Computer Graphics. 455--465.
[33]
Christian Rössl, Leif Kobbelt, and Hans-Peter Seidel. 2000. Extraction of feature lines on triangulated surfaces using morphological operators. In AAAI Symp. Smart Graphics, Vol. 00--04. 71--75.
[34]
Leonardo Sacht, Alec Jacobson, Daniele Panozzo, Christian Schüller, and Olga Sorkine-Hornung. 2013. Consistent Volumetric Discretizations Inside Self-Intersecting Surfaces. Computer Graphics Forum 32, 5 (2013), 147--156.
[35]
Leonardo Sacht, Etienne Vouga, and Alec Jacobson. 2015. Nested Cages. ACM Trans. Graph. 34, 6, Article 170 (2015), 170:1--170:14 pages.
[36]
Pedro V. Sander, Xianfeng Gu, Steven J. Gortler, Hugues Hoppe, and John Snyder. 2000. Silhouette Clipping. In Proc. SIGGRAPH. 327--334.
[37]
Michael Schwarz and Hans-Peter Seidel. 2010. Fast Parallel Surface and Solid Voxelization on GPUs. ACM Trans. Graph. 29, 6 (2010), 179:1--179:10.
[38]
Jean Serra. 1983. Image Analysis and Mathematical Morphology. Academic Press, Inc.
[39]
Chen Shen, James F. O'Brien, and Jonathan R. Shewchuk. 2004. Interpolating and Approximating Implicit Surfaces from Polygon Soup. In Proc. SIGGRAPH. 896--904.
[40]
A. Söderström and K. Museth. 2010. A Spatially Adaptive Morphological Filter for Dual-Resolution Interface Tracking of Fluids. In Eurographics. 5--8.
[41]
Pierre Soille, Edmond J. Breen, and Ronald Jones. 1996. Recursive Implementation of Erosions and Dilations Along Discrete Lines at Arbitrary Angles. IEEE Trans. Pattern Anal. Mach. Intell. 18, 5 (1996), 562--567.
[42]
Marco Tarini, Nico Pietroni, Paolo Cignoni, Daniele Panozzo, and Enrico Puppo. 2010. Practical quad mesh simplification. Computer Graphics Forum 29, 2 (2010), 407--418.
[43]
Jean-Marc Thiery, Émilie Guy, and Tamy Boubekeur. 2013. Sphere-Meshes: Shape Approximation Using Spherical Quadric Error Metrics. ACM Trans. Graph. 32, 6, Article 178 (2013), 178:1--178:12 pages.
[44]
Matthew Thurley and Victor Danell. 2012. Fast morphological image processing open-source extensions for GPU processing with CUDA. IEEE Journal on Selected Topics in Signal Processing 6, 7 (2012), 849--855.
[45]
Marcel van Herk. 1992. A Fast Algorithm for Local Minimum and Maximum Filters on Rectangular and Octagonal Kernels. Pattern Recogn. Lett. 13, 7 (1992), 517--521.
[46]
Chuhua Xian, Hongwei Lin, and Shuming Gao. 2009. Automatic generation of coarse bounding cages from dense meshes. In IEEE SMI. 21--27.
[47]
Chuhua Xian, Hongwei Lin, and Shuming Gao. 2012. Automatic cage generation by improved OBBs for mesh deformation. The Visual Computer 28, 1 (2012), 21--33.
[48]
Steve Zelinka and Michael Garland. 2002. Permission Grids: Practical, Error-bounded Simplification. ACM Trans. Graph. 21, 2 (2002), 207--229.

Cited By

View all
  • (2024)Proxy Asset Generation for Cloth Simulation in GamesACM Transactions on Graphics10.1145/365817743:4(1-12)Online publication date: 19-Jul-2024
  • (2024)A Survey on Cage‐based Deformation of 3D ModelsComputer Graphics Forum10.1111/cgf.1506043:2Online publication date: 30-Apr-2024
  • (2024)Robust Coarse Cage Construction With Small Approximation ErrorsIEEE Transactions on Visualization and Computer Graphics10.1109/TVCG.2023.325520730:7(4234-4245)Online publication date: 1-Jul-2024
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Graphics
ACM Transactions on Graphics  Volume 36, Issue 4
August 2017
2155 pages
ISSN:0730-0301
EISSN:1557-7368
DOI:10.1145/3072959
Issue’s Table of Contents
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 20 July 2017
Published in TOG Volume 36, Issue 4

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. bounding volumes
  2. geometric simplification
  3. mathematical morphology
  4. proxy
  5. shape approximation

Qualifiers

  • Research-article

Funding Sources

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)63
  • Downloads (Last 6 weeks)6
Reflects downloads up to 17 Jan 2025

Other Metrics

Citations

Cited By

View all
  • (2024)Proxy Asset Generation for Cloth Simulation in GamesACM Transactions on Graphics10.1145/365817743:4(1-12)Online publication date: 19-Jul-2024
  • (2024)A Survey on Cage‐based Deformation of 3D ModelsComputer Graphics Forum10.1111/cgf.1506043:2Online publication date: 30-Apr-2024
  • (2024)Robust Coarse Cage Construction With Small Approximation ErrorsIEEE Transactions on Visualization and Computer Graphics10.1109/TVCG.2023.325520730:7(4234-4245)Online publication date: 1-Jul-2024
  • (2024)Quality-preserving multilevel mesh generation for building modelsInternational Journal of Digital Earth10.1080/17538947.2024.237626917:1Online publication date: 16-Jul-2024
  • (2024)WindPoly: Polygonal Mesh Reconstruction via Winding NumbersComputer Vision – ECCV 202410.1007/978-3-031-72970-6_17(294-311)Online publication date: 23-Nov-2024
  • (2023)Robust Low-Poly Meshing for General 3D ModelsACM Transactions on Graphics10.1145/359239642:4(1-20)Online publication date: 26-Jul-2023
  • (2023)Convex Decomposition of Indoor Scenes2023 IEEE/CVF International Conference on Computer Vision (ICCV)10.1109/ICCV51070.2023.00842(9142-9152)Online publication date: 1-Oct-2023
  • (2023)Creative Birds: Self-Supervised Single-View 3D Style Transfer2023 IEEE/CVF International Conference on Computer Vision (ICCV)10.1109/ICCV51070.2023.00806(8741-8750)Online publication date: 1-Oct-2023
  • (2022)Low-poly Mesh Generation for Building ModelsACM SIGGRAPH 2022 Conference Proceedings10.1145/3528233.3530716(1-9)Online publication date: 27-Jul-2022
  • (2022)EARSACM Transactions on Graphics10.1145/3528223.353016841:4(1-14)Online publication date: 22-Jul-2022
  • Show More Cited By

View Options

Login options

Full Access

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media