Simple finite element‐based computation of distance functions in unstructured grids
- 8 May 2007
- journal article
- research article
- Published by Wiley in International Journal for Numerical Methods in Engineering
- Vol. 72 (9) , 1095-1110
Abstract
A distance field is a representation of the closest distance from a point to a given surface. Distance fields are widely used in applications ranging from computer vision, physics and computer graphics and have been the subject of research of many authors in the last decade. Most of the methods for computing distance fields are devoted to Cartesian grids while little attention has been paid to unstructured grids. Finite element methods are well known for their ability to deal with partial differential equations in unstructured grids. Therefore, we propose an extension of the fast marching method for computing a distance field in a finite element context employing the element interpolation to hold the Eikonal property (∥∇φ∥ = 1). A simple algorithm to develop the computations is also presented and its efficiency demonstrated through various unstructured grid examples. We observed that the presented algorithm has processing times proportional to the number of mesh nodes. Copyright © 2007 John Wiley & Sons, Ltd.Keywords
This publication has 17 references indexed in Scilit:
- 3D distance fields: a survey of techniques and applicationsIEEE Transactions on Visualization and Computer Graphics, 2006
- Hydrodynamic simulation of air bubble implosion using a level set approachJournal of Computational Physics, 2006
- A quadrature-free discontinuous Galerkin method for the level set equationJournal of Computational Physics, 2006
- Computation of incompressible bubble dynamics with a stabilized finite element level set methodComputer Methods in Applied Mechanics and Engineering, 2005
- An assumed-gradient finite element method for the level set equationInternational Journal for Numerical Methods in Engineering, 2005
- A vector level set method and new discontinuity approximations for crack growth by EFGInternational Journal for Numerical Methods in Engineering, 2002
- An Efficient, Interface-Preserving Level Set Redistancing Algorithm and Its Application to Interfacial Incompressible Fluid FlowSIAM Journal on Scientific Computing, 1999
- Numerical Schemes for the Hamilton–Jacobi and Level Set Equations on Triangulated DomainsJournal of Computational Physics, 1998
- A Level Set Approach for Computing Solutions to Incompressible Two-Phase FlowJournal of Computational Physics, 1994
- A Viscosity Solutions Approach to Shape-From-ShadingSIAM Journal on Numerical Analysis, 1992