Approximate convex decomposition and transfer for animated meshes

Many geometric quantities can be computed efficiently for convex meshes. For general meshes, methods for approximate convex decomposition have been developed that decompose a static, non-convex object into a small set of approximately convex parts. The convex hulls of those parts can then be used as a piecewise convex approximation to the original mesh. While previous work was only concerned with static meshes, we present a method for decomposing animated 3D meshes into temporally coherent approximately convex parts. Given a mesh and several training frames---that is, different spatial configurations of its vertices---we precompute an approximate convex decomposition that is independent of any specific frame. Such a decomposition can be transferred in real-time to novel, unseen frames. We apply our method to a variety of pre-animated meshes as well as a 3D character interactively controlled by a user's body pose. We further demonstrate that our method enables real-time physics simulations to interact with animated meshes.

[1]  Ayellet Tal,et al.  Metamorphosis of Polyhedral Surfaces using Decomposition , 2002, Comput. Graph. Forum.

[2]  Philip M. Hubbard,et al.  Collision Detection for Interactive Graphics Applications , 1995, IEEE Trans. Vis. Comput. Graph..

[3]  Mongi A. Abidi,et al.  Perception-based 3D triangle mesh segmentation using fast marching watersheds , 2003, 2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2003. Proceedings..

[4]  Junsong Yuan,et al.  Minimum near-convex decomposition for robust shape representation , 2011, 2011 International Conference on Computer Vision.

[5]  Barbara Solenthaler,et al.  Data-driven fluid simulations using regression forests , 2015, ACM Trans. Graph..

[6]  Nancy M. Amato,et al.  Fast approximate convex decomposition using relative concavity , 2013, Comput. Aided Des..

[7]  Paul L. Rosin,et al.  A new convexity measure for polygons , 2004, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[8]  Doug L. James,et al.  Skinning mesh animations , 2005, ACM Trans. Graph..

[9]  Joseph S. B. Mitchell,et al.  Efficient Collision Detection Using Bounding Volume Hierarchies of k-DOPs , 1998, IEEE Trans. Vis. Comput. Graph..

[10]  S. Sathiya Keerthi,et al.  A fast procedure for computing the distance between complex objects in three-dimensional space , 1988, IEEE J. Robotics Autom..

[11]  Ayellet Tal,et al.  Paper craft models from meshes , 2006, The Visual Computer.

[12]  Stephen Cameron,et al.  Enhancing GJK: computing minimum and penetration distances between convex polyhedra , 1997, Proceedings of International Conference on Robotics and Automation.

[13]  Tamy Boubekeur,et al.  Bounding proxies for shape approximation , 2017, ACM Trans. Graph..

[14]  Alla Sheffer,et al.  Model Composition from Interchangeable Components , 2007, 15th Pacific Conference on Computer Graphics and Applications (PG'07).

[15]  Zhonghua Xi,et al.  Nearly convex segmentation of polyhedra through convex ridge separation , 2016, Comput. Aided Des..

[16]  Pengfei Xu,et al.  Mesh Segmentation with Concavity-Aware Fields , 2012, IEEE Transactions on Visualization and Computer Graphics.

[17]  Eric Lengyel.  Volumetric Hierarchical Approximate Convex Decomposition , 2016 .

[18]  Alan Brunton,et al.  Segmenting animated objects into near-rigid components , 2010, The Visual Computer.

[19]  Dinesh Manocha,et al.  OBBTree: a hierarchical structure for rapid interference detection , 1996, SIGGRAPH.

[20]  Doug L. James,et al.  BD-tree: output-sensitive collision detection for reduced deformable models , 2004, SIGGRAPH 2004.

[21]  Tong-Yee Lee,et al.  Mesh decomposition using motion information from animation sequences: Animating Geometrical Models , 2005 .

[22]  Tamy Boubekeur,et al.  Animated Mesh Approximation With Sphere-Meshes , 2016, ACM Trans. Graph..

[23]  Jirí Zára,et al.  Fast Collision Detection for Skeletally Deformable Models , 2005, Comput. Graph. Forum.

[24]  Marco Attene,et al.  Hierarchical Convex Approximation of 3D Shapes for Fast Region Selection , 2008, Comput. Graph. Forum.

[25]  Hao Zhang,et al.  Mesh Segmentation via Spectral Embedding and Contour Analysis , 2007, Comput. Graph. Forum.

[26]  Daniel Cohen-Or,et al.  Shape Segmentation by Approximate Convexity Analysis , 2014, ACM Trans. Graph..

[27]  Faouzi Ghorbel,et al.  A simple and efficient approach for 3D mesh approximate convex decomposition , 2009, 2009 16th IEEE International Conference on Image Processing (ICIP).

[28]  Tong-Yee Lee,et al.  Mesh decomposition using motion information from animation sequences , 2005, Comput. Animat. Virtual Worlds.

[29]  Aaron Hertzmann,et al.  Learning 3D mesh segmentation and labeling , 2010, ACM Trans. Graph..

[30]  Leif Kobbelt,et al.  Structure Recovery via Hybrid Variational Surface Approximation , 2005, Comput. Graph. Forum.

[31]  Meng Liu,et al.  Fast hierarchical animated object decomposition using approximately invariant signature , 2012, The Visual Computer.

[32]  Daniel Cohen-Or,et al.  Weak Convex Decomposition by Lines‐of‐sight , 2013, SGP '13.

[33]  Nancy M. Amato,et al.  Approximate convex decomposition of polyhedra , 2004, Symposium on Solid and Physical Modeling.

[34]  Luiz Velho,et al.  A Hierarchical Segmentation of Articulated Bodies , 2008, Comput. Graph. Forum.

[35]  Nancy M. Amato,et al.  Approximate convex decomposition of polygons , 2004, SCG '04.

[36]  Bernard Chazelle,et al.  Convex decompositions of polyhedra , 1981, STOC '81.