GPU-based tolerance volumes for mesh processing

In an increasing number of applications triangle meshes represent a flexible and efficient alternative to traditional NURBS-based surface representations. Especially in engineering applications it is crucial to guarantee that a prescribed approximation tolerance to a given reference geometry is respected for any combination of geometric algorithms that are applied when processing a triangle mesh. We propose a simple and generic method for computing the distance of a given polygonal mesh to the reference surface, based on a linear approximation of its signed distance field. Exploiting the hardware acceleration of modern GPUs allows us to perform up to 3M triangle checks per second, enabling real-time distance evaluations even for complex geometries. An additional feature of our approach is the accurate high-quality distance visualization of dynamically changing meshes at a rate of 15M triangles per second. Due to its generality, the presented approach can be used to enhance any mesh processing method by global error control, guaranteeing the resulting mesh to stay within a prescribed error tolerance. The application examples that we present include mesh decimation, mesh smoothing and freeform mesh deformation.

[1]  Dinesh Manocha,et al.  DiFi: Fast 3D Distance Field Computation Using Graphics Hardware , 2004, Comput. Graph. Forum.

[2]  Reinhard Klein,et al.  Mesh reduction with error control , 1996, Proceedings of Seventh Annual IEEE Visualization '96.

[3]  Mark Segal,et al.  The OpenGL Graphics System: A Specification , 2004 .

[4]  Paolo Cignoni,et al.  Metro: Measuring Error on Simplified Surfaces , 1998, Comput. Graph. Forum.

[5]  Jakob Andreas Bærentzen,et al.  Pseudo-Normals for Signed Distance Computation , 2003, VMV.

[6]  Thomas W. Sederberg,et al.  Free-form deformation of solid geometric models , 1986, SIGGRAPH.

[7]  Leif Kobbelt,et al.  Piecewise Linear Approximation of Signed Distance Fields , 2003, VMV.

[8]  Hans-Peter Seidel,et al.  A General Framework for Mesh Decimation , 1998, Graphics Interface.

[9]  Mark Meyer,et al.  Implicit fairing of irregular meshes using diffusion and curvature flow , 1999, SIGGRAPH.

[10]  Leif Kobbelt Freeform Shape Representations for Efficient Geometry Processing , 2003, Comput. Graph. Forum.

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

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

[13]  David E. Breen,et al.  Level set surface editing operators , 2002, ACM Trans. Graph..

[14]  Ronald N. Perry,et al.  Adaptively sampled distance fields: a general representation of shape for computer graphics , 2000, SIGGRAPH.

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

[16]  Dinesh Manocha,et al.  Fast computation of generalized Voronoi diagrams using graphics hardware , 1999, SIGGRAPH.

[17]  Christof Rezk Salama Volumenvisualisierung auf handelsüblicher Grafik-Hardware (Volume Rendering Techniques for General Purpose Graphics Hardware) , 2005 .

[18]  J A Sethian,et al.  A fast marching level set method for monotonically advancing fronts. , 1996, Proceedings of the National Academy of Sciences of the United States of America.