This Article 
 Bibliographic References 
 Add to: 
Topology-Adaptive Mesh Deformation for Surface Evolution, Morphing, and Multiview Reconstruction
April 2011 (vol. 33 no. 4)
pp. 823-837
Andrei Zaharescu, INRIA Grenoble Rhone-Alpes, Montbonnot, Saint-Martin
Edmond Boyer, INRIA Grenoble Rhone-Alpes, Montbonnot, Saint-Martin
Radu Horaud, INRIA Grenoble, Montbonnot, Saint Ismier
Triangulated meshes have become ubiquitous discrete surface representations. In this paper, we address the problem of how to maintain the manifold properties of a surface while it undergoes strong deformations that may cause topological changes. We introduce a new self-intersection removal algorithm, TransforMesh, and propose a mesh evolution framework based on this algorithm. Numerous shape modeling applications use surface evolution in order to improve shape properties such as appearance or accuracy. Both explicit and implicit representations can be considered for that purpose. However, explicit mesh representations, while allowing for accurate surface modeling, suffer from the inherent difficulty of reliably dealing with self-intersections and topological changes such as merges and splits. As a consequence, a majority of methods rely on implicit representations of surfaces, e.g., level sets, that naturally overcome these issues. Nevertheless, these methods are based on volumetric discretizations, which introduce an unwanted precision-complexity trade-off. The method that we propose handles topological changes in a robust manner and removes self-intersections, thus overcoming the traditional limitations of mesh-based approaches. To illustrate the effectiveness of TransforMesh, we describe several challenging applications: surface morphing and 3D reconstruction.

[1] S. Osher and R. Fedkiw, Level Set Methods and Dynamic Implicit Surfaces. Springer, 2003.
[2] S. Osher and J. Senthian, "Front Propagating with Curvature Dependent Speed: Algorithms Based on the Hamilton-Jacobi Formulation," J. Computational Physics, vol. 79, no. 1, pp. 12-49, 1988.
[3] W.E. Lorensen and H.E. Cline, "Marching Cubes: A High Resolution 3D Surface Construction Algorithm," Computer Graphics, vol. 21, no. 4, pp. 163-169, July 1987.
[4] L.P. Kobbelt, M. Botsch, U. Schwanecke, and H.-P. Seidel, "Feature Sensitive Surface Extraction from Volume Data," Proc. ACM SIGGRAPH, pp. 57-66, 2001.
[5] T. Ju, F. Losasso, S. Schaefer, and J. Warren, "Dual Contouring of Hermite Data," Proc. ACM SIGGRAPH, 2002.
[6] Y. Ohtake, A. Belyaev, and A. Pasko, "Dynamic Mesh Optimization for Polygonized Implicit Surfaces with Sharp Features," The Visual Computer, vol. 19, pp. 115-126, 2003.
[7] S. Osher and N. Paragios, Geometric Level Set Methods in Imaging, Vision, and Graphics. Springer, 2003.
[8] M. Sussman, P. Smereka, and S. Osher, "A Level Set Approach for Computing Solutions to Incompressible Two-Phase Flow," J. Computational Physics, vol. 114, no. 1, pp. 146-159, 1994.
[9] D. Enright, S. Marschner, and R. Fedkiw, "Animation and Rendering of Complex Water Surfaces," Proc. ACM SIGGRAPH, pp. 736-744, 2002.
[10] D. Adalsteinsson and J. Senthian, "A Fast Level Set Method for Propagating Interfaces," J. Computational Physics, vol. 118, no. 2, pp. 269-277, 1995.
[11] F. Losasso, R. Fedkiw, and S. Osher, "Spatially Adaptive Techniques for Level Set Methods and Incompressible Flow," Computers and Fluids, vol. 35, no. 10, pp. 995-1010, 2006.
[12] D. Enright, R. Fedkiw, J. Ferziger, and I. Mitchell, "A Hybrid Particle Level Set Method for Improved Interface Capturing," J. Computational Physics, vol. 183, no. 1, pp. 83-116, 2002.
[13] J.-J. Park, T. McInerney, D. Terzopoulos, and M.-H. Kim, "A Non-Self-Intersection Adaptive Deformable Surface for Complex Boundary Extraction from Volumetric Images," Computer and Graphics, vol. 25, pp. 421-440, 2001.
[14] C.E. Hernández and F. Schmitt, "Silhouette and Stereo Fusion for 3D Object Modeling," Computer Vision and Image Understanding, vol. 96, no. 3, pp. 367-392, 2004.
[15] T. McInerney and D. Terzopoulos, "T-Snakes: Topology Adaptive Snakes," Medical Image Analysis, vol. 4, no. 2, pp. 73-91, 2000.
[16] J.-O. Lachaud and B. Taton, "Deformable Model with Adaptive Mesh and Automated Topology Changes," Proc. Fourth Int'l Conf. 3D Digital Imaging and Modeling, 2003.
[17] Y. Duan, L. Yang, H. Qin, and D. Samara, "Shape Reconstruction from 3D and 2D Data Using PDE-Based Deformable Surfaces," Proc. European Conf. Computer Vision, vol. 3, pp. 238-251, 2004.
[18] T. Brochu and R. Bridson, "Robust Topological Operations for Dynamic Explicit Surfaces," SIAM J. Scientific Computing, vol. 31, no. 4, pp. 2472-2493, 2009.
[19] J.-P. Pons and J.-D. Boissonnat, "Delaunay Deformable Models: Topology Adaptive Meshes Based on the Restricted Delaunay Triangulation," Proc. IEEE Conf. Computer Vision and Pattern Recognition, June 2007.
[20] M. Aftosmis, M. Berger, and J. Melton, "Robust, Efficient Cartesian Mesh Generation for Component-Based Geometry," AIAA Paper 97-0196,, 1997.
[21] W. Jung, H. Shin, and B.K. Choi, "Self-Intersection Removal in Triangular Mesh Offsetting," Computer-Aided Design and Applications, vol. 1, nos. 1-4, pp. 477-484, 2004.
[22] C. Wojtan, N. Thurey, M. Gross, and G. Turk, "Deforming Meshes That Split and Merge," Proc. ACM SIGGRAPH, 2009.
[23] J.D. Foley, A. van Dam, S. Feiner, and J.F. Hughes, Computer Graphics: Principles and Practice. Addison Wesley, 1990.
[24] P.M. Hubbard, "Constructive Solid Geometry for Triangulated Polyhedra," Technical Report CS-90-07, Dept. of Computer Science, Brown Univ., html , Jan. 1990.
[25] B.G. Baumgart, "Geometric Modeling for Computer Vision," PhD dissertation, Stanford Univ., 1974.
[26] I.C. Braid, R.C. Hillyard, and I.A. Stroud, "Stepwise Construction of Polyhedra in Geometric Modelling," Math. Methods in Computer Graphics and Design, Academic Press, 1978.
[27] A. Agrawal and A. Requicha, "A Paradigm for the Robust Design of Algorithms for Geometric Modeling," Computer Graphics Forum, vol. 13, no. 3, pp. 33-44, 1994.
[28] J. Rossignac and A. Requicha, "Solid Modeling," Encyclopedia of Electrical and Electronics Eng., John Wiley and Sons, 1999.
[29] A. Rappoport and S. Spitz, "Interactive Boolean Operations for Conceptual Design of 3D Solids," Proc. ACM SIGGRAPH, pp. 269-278, 1997.
[30] J. Goldfeather, J.P.M. Hultquist, and H. Fuchs, "Fast Constructive-Solid Geometry Display in the Pixel-Powers Graphics System," Proc. ACM SIGGRAPH, pp. 107-116, July 1986.
[31] H. Biermann, D. Kristjansson, and D. Zorin, "Approximate Boolean Operations on Free-Form Solids," Proc. ACM SIGGRAPH, pp. 185-194, 2001.
[32] A.L.N. Litke and P. Schröder, "Trimming for Subdivision Surfaces," technical report, Caltech, 2000.
[33] S.M. Seitz, B. Curless, J. Diebel, D. Scharstein, and R. Szeliski, "A Comparison and Evaluation of Multi-View Stereo Reconstruction Algorithms," Proc. IEEE Conf. Computer Vision and Pattern Recognition, vol. 1, pp. 519-526, http://vision.middlebury.edumview/, 2006.
[34] P. Carvalho and P. Cavalcanti, "Point in Polyhedron Testing Using Spherical Polygons," Graphics Gem V, ch. II, pp. 42-49, Academic Press, 1995.
[35] J. Foley, A.V. Dam, S.K. Feiner, and J.F. Hughes, Computer Graphics: Principles and Practice, second ed. Addison Wesley, 1996.
[36] L. Kettner, A. Meyer, and A. Zomorodian, "Intersecting Sequences of dD Iso-Oriented Boxes," CGAL-3.2 User and Reference Manual, C.E. Board, ed., cgal_manualpackages.html#Pkg:BoxIntersectionD , 2006.
[37] A. Zomorodian and H. Edelsbrunner, "Fast Software for Box Intersection," Int'l J. Computational Geometry and Applications, vol. 12, nos. 1/2, pp. 143-172, 2002.
[38] P. Alliez, S. Tayeb, and C. Wormser, "AABB Tree," CGAL User and Reference Manual, third ed., CGAL Editorial Board, ed., cgal_manualpackages. html#Pkg:AABB_tree , 2009.
[39] S. Hert and M. Seel, "dD Convex Hulls and Delaunay Triangulations," CGAL-3.2 User and Reference Manual, C.E. Board, ed., cgal_manualpackages.html#Pkg:ConvexHullD , 2006.
[40] A. Gueziec, G. Taubin, F. Lazarus, and B. Horn, "Cutting and Stitching: Converting Sets of Polygons to Manifold Surfaces," IEEE Trans. Visualization and Computer Graphics, vol. 7, no. 2, pp. 136-151, Apr.-June 2001.
[41] H. Shin, J.C. Park, B.K. Choi, Y.C. Chung, and S. Rhee, "Efficient Topology Construction from Triangle Soup," Proc. Geometric Modeling and Processing, 2004.
[42] H. Edelsbrunner and E. Mücke, "Simulation of Simplicity: A Technique to Cope with Degenerate Cases in Geometric Algorithms," ACM Trans. Graphics, vol. 9, no. 1, pp. 66-104, 1990.
[43] M. Mäntylä, "Boolean Operations of 2-Manifolds through Vertex Neighborhood Classification," ACM Trans. Graphics, vol. 5, no. 1, pp. 1-29, 1986.
[44] C.E. Board, CGAL-3.2 User and Reference Manual, cgal_manualindex.html, 2006.
[45] C. Wojtan and G. Turk, "Fast Viscoelastic Behavior with Thin Features," Proc. ACM SIGGRAPH, 2008.
[46] G. Celniker and D. Gossard, "Deformable Curve and Surface Finite-Elements for Free-Form Shape Design," Computer Graphics, vol. 25, pp. 257-266, 1991.
[47] L. Kobbelt, T. Bareuther, and H.-P. Seidel, "Multiresolution Shape Deformations for Meshes with Dynamic Vertex Connectivity," Proc. Eurographics, pp. 249-260, 2000.
[48] M. Meyer, M. Desbrun, P. Schröder, and A.H. Barr, "Discrete Differential Geometry Operators for Triangulated 2-Dimensional Manifolds," Proc. Workshop Visualization and Math., 2002.
[49] H. Delingette, M. Herbert, and K. Ikeuchi, "Shape Representation and Image Segmentation using Deformable Surfaces," Image and Vision Computing, vol. 10, pp. 132-145, 1992.
[50] D.E. Breen and R.T. Whitaker, "A Level-Set Approach for the Metamorphosis of Solid Models," IEEE Trans. Visualization and Computer Graphics, vol. 7, no. 2, pp. 173-192, Apr.-June 2001.
[51] M.W. Jones, J.A. Bærentzen, and M. Sramek, "3D Distance Fields: A Survey of Techniques and Applications," IEEE Trans. Visualization and Computer Graphics, vol. 12, no. 4, pp. 581-599, July/Aug. 2006.
[52] G.R. Hjaltason and H. Samet, "Ranking in Spatial Databases," Proc. Symp. Large Spatial Databases, pp. 83-95, 1995.
[53] H. Hoppe, T. DeRose, T. Duchamp, J. MCDonald, and W. Stuetzle, "Surface Reconstruction from Unorganized Points," Proc. ACM SIGGRAPH, 1992.
[54] Y. Furukawa and J. Ponce, "Accurate, Dense, and Robust Multi-View Stereopsis," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 32, no. 8, pp. 1362-1376, Aug. 2010.
[55] K. Varanasi, A. Zaharescu, E. Boyer, and R.P. Horaud, "Temporal Surface Tracking Using Mesh Evolution," Proc. European Conf. Computer Vision, 2008.
[56] J.-P. Pons, R. Keriven, and O. Faugeras, "Multi-View Stereo Reconstruction and Scene Flow Estimation with a Global Image-Based Matching Score," Int'l J. Computer Vision, vol. 72, no. 2, pp. 179-193, 2007.
[57] H. Vu, R. Keriven, P. Labatut, and J.-P. Pons, "Towards High-Resolution Large-Scale Multi-View Stereo," Proc. IEEE Conf. Computer Vision and Pattern Recognition, June 2009.
[58] J.-S. Franco and E. Boyer, "Exact Polyhedral Visual Hulls," Proc. British Machine Vision Conf., vol. 1, pp. 329-338, Sept. 2003.
[59] A. Zaharescu and R.P. Horaud, "Robust Factorization Methods Using a Gaussian/Uniform Mixture Model," Int'l J. Computer Vision, vol. 81, no. 3, pp. 240-258 , Mar. 2009.
[60] N. Amenta, S. Choi, and R. Kolluri, "The Power Crust, Unions of Balls, and the Medial Axis Transform," Computational Geometry: Theory and Applications, vol. 19, nos. 2/3, pp. 127-153, 2001.
[61] J.S. Franco and E. Boyer, "Efficient Polyhedral Modeling from Silhouettes," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 31, no. 3, pp. 414-427, Mar. 2009.
[62] S.M. Seitz and C.R. Dyer, "Photorealistic Scene Reconstruction by Voxel Coloring," Int'l J. Computer Vision, vol. 35, no. 2, pp. 151-173, 1999.

Index Terms:
Mesh, surface, manifold mesh, triangulated mesh, mesh evolution, deformable objects, morphing, 3D reconstruction.
Andrei Zaharescu, Edmond Boyer, Radu Horaud, "Topology-Adaptive Mesh Deformation for Surface Evolution, Morphing, and Multiview Reconstruction," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 33, no. 4, pp. 823-837, April 2011, doi:10.1109/TPAMI.2010.116
Usage of this product signifies your acceptance of the Terms of Use.