Fast grid-free surface tracking

We present a novel explicit surface tracking method. Its main advantage over existing approaches is the fact that it is both completely grid-free and fast which makes it ideal for the use in large unbounded domains. A further advantage is that its running time is less sensitive to temporal variations of the input mesh than existing approaches. In terms of performance, the method provides a good trade-off point between speed and quality. The main idea behind our approach to handle topological changes is to delete all overlapping triangles and to fill or join the resulting holes in a robust and efficient way while guaranteeing that the output mesh is both manifold and without boundary. We demonstrate the flexibility, speed and quality of our method in various applications such as Eulerian and Lagrangian liquid simulations and the simulation of solids under large plastic deformations.

[1]  J. Strain A Fast Semi-Lagrangian Contouring Method for Moving Interfaces , 2001 .

[2]  M. Gross,et al.  A multiscale approach to mesh-based surface tension flows , 2010, ACM Trans. Graph..

[3]  Jean-Philippe Pernot,et al.  Filling holes in meshes using a mechanical model to simulate the curvature variation minimization , 2006, Comput. Graph..

[4]  James F. O'Brien,et al.  A semi-Lagrangian contouring method for fluid simulation , 2005, TOGS.

[5]  Matthias Müller,et al.  Fast and robust tracking of fluid surfaces , 2009, SCA '09.

[6]  Marcel Campen,et al.  Exact and Robust (Self‐)Intersections for Polygonal Meshes , 2010, Comput. Graph. Forum.

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

[8]  J. Sethian,et al.  Fronts propagating with curvature-dependent speed: algorithms based on Hamilton-Jacobi formulations , 1988 .

[9]  R. Fedkiw,et al.  USING THE PARTICLE LEVEL SET METHOD AND A SECOND ORDER ACCURATE PRESSURE BOUNDARY CONDITION FOR FREE SURFACE FLOWS , 2003 .

[10]  James F. Blinn,et al.  A Generalization of Algebraic Surface Drawing , 1982, TOGS.

[11]  Tae-Yong Kim,et al.  Unified particle physics for real-time applications , 2014, ACM Trans. Graph..

[12]  Christopher Wojtan,et al.  Putting holes in holey geometry , 2013, ACM Trans. Graph..

[13]  Micha Sharir,et al.  Filling gaps in the boundary of a polyhedron , 1995, Comput. Aided Geom. Des..

[14]  J. Sethian,et al.  FRONTS PROPAGATING WITH CURVATURE DEPENDENT SPEED: ALGORITHMS BASED ON HAMILTON-JACOB1 FORMULATIONS , 2003 .

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

[16]  Marco Attene,et al.  Polygon mesh repairing: An application perspective , 2013, CSUR.

[17]  Marcin Novotni,et al.  Progressive Gap Closing for MeshRepairing , 2002 .

[18]  Jihun Yu,et al.  Reconstructing surfaces of particle-based fluids using anisotropic kernels , 2010, SCA '10.

[19]  Jean-Philippe Pons,et al.  Delaunay Deformable Models: Topology-Adaptive Meshes Based on the Restricted Delaunay Triangulation , 2007, 2007 IEEE Conference on Computer Vision and Pattern Recognition.

[20]  Yongtae Jun,et al.  A piecewise hole filling algorithm in reverse engineering , 2005, Comput. Aided Des..

[21]  Radu Horaud,et al.  TransforMesh : A Topology-Adaptive Mesh-Based Approach to Surface Evolution , 2007, ACCV.

[22]  Leonidas J. Guibas,et al.  Adaptively sampled particle fluids , 2007, ACM Trans. Graph..

[23]  Greg Turk,et al.  Reconstructing surfaces of particle-based fluids using anisotropic kernels , 2010, SCA 2010.

[24]  Markus H. Gross,et al.  Optimized Spatial Hashing for Collision Detection of Deformable Objects , 2003, VMV.

[25]  L. Paul Chew,et al.  Constrained Delaunay triangulations , 1987, SCG '87.

[26]  Jonathan Richard Shewchuk,et al.  Adaptive Precision Floating-Point Arithmetic and Fast Robust Geometric Predicates , 1997, Discret. Comput. Geom..

[27]  Szymon Rusinkiewicz,et al.  Eurographics Symposium on Geometry Processing (2005) Atomic Volumes for Mesh Completion , 2022 .

[28]  Thomas Martin Deserno,et al.  A General Discrete Contour Model in Two, Three, and Four Dimensions for Topology-Adaptive Multichannel Segmentation , 2003, IEEE Trans. Pattern Anal. Mach. Intell..

[29]  Markus H. Gross,et al.  Deforming meshes that split and merge , 2009, ACM Trans. Graph..

[30]  Wei Zhao,et al.  A robust hole-filling algorithm for triangular mesh , 2007, 2007 10th IEEE International Conference on Computer-Aided Design and Computer Graphics.

[31]  Zhi Yuan,et al.  Enhancing fluid animation with adaptive, controllable and intermittent turbulence , 2010, SCA '10.

[32]  Raphaëlle Chaine,et al.  Freestyle: Sculpting meshes with self-adaptive topology , 2011, Comput. Graph..

[33]  Gabriel Taubin,et al.  Cutting and Stitching: Converting Sets of Polygons to Manifold Surfaces , 2001, IEEE Trans. Vis. Comput. Graph..

[34]  David P. Dobkin,et al.  The quickhull algorithm for convex hulls , 1996, TOMS.

[35]  Peter Liepa,et al.  Filling Holes in Meshes , 2003, Symposium on Geometry Processing.

[36]  Tomas Akenine-Möller,et al.  A Fast Triangle-Triangle Intersection Test , 1997, J. Graphics, GPU, & Game Tools.

[37]  John Hart,et al.  ACM Transactions on Graphics , 2004, SIGGRAPH 2004.

[38]  Marcel Campen,et al.  Hybrid Booleans , 2010, Comput. Graph. Forum.

[39]  Ronald Fedkiw,et al.  Animation and rendering of complex water surfaces , 2002, ACM Trans. Graph..

[40]  Robert Bridson,et al.  Robust Topological Operations for Dynamic Explicit Surfaces , 2009, SIAM J. Sci. Comput..

[41]  Eitan Grinspun,et al.  Multimaterial mesh-based surface tracking , 2014, ACM Trans. Graph..

[42]  Bernard Chazelle Triangulating a simple polygon in linear time , 1991, Discret. Comput. Geom..

[43]  Robert Bridson,et al.  Animating sand as a fluid , 2005, ACM Trans. Graph..

[44]  M. Gross,et al.  Physics-inspired topology changes for thin fluid features , 2010, ACM Trans. Graph..

[45]  Jihun Yu,et al.  Explicit Mesh Surfaces for Particle Based Fluids , 2012, Comput. Graph. Forum.

[46]  Frank Losasso,et al.  A fast and accurate semi-Lagrangian particle level set method , 2005 .

[47]  Ping Hu,et al.  Filling Holes in Triangular Meshes in Engineering , 2012, J. Softw..

[48]  M. Gross,et al.  A multiscale approach to mesh-based surface tension flows , 2010, SIGGRAPH 2010.

[49]  Nancy M. Amato,et al.  Linear-time triangulation of a simple polygon made easier via randomization , 2000, SCG '00.