Computing discrete signed distance fields from triangle meshes |
| | Abstract | A method for generating a discrete, signed 3D distance field is proposed. Distance fields are used in a number of contexts. In particular the popular level set method is usually initialized by a distance field. The main focus of our work is on simplifying the computation of the sign when generating signed distance fields. Previous methods largely rely on scan conversion to classify voxels as being inside or outside. In contrast, our method relies on defining a pseudo normal, the angle weighted normal, which is used to determine, for each grid point, whether that point is inside or outside. This leads to a method for generating signed distance fields which is a simple and straight-forward extension of the method for generating unsigned distance fields. We prove that our choice of pseudo normal leads to a correct technique for computing the sign. | | Keywords | Distance Field, Signed Distance Field, Mesh, Triangle Mesh, Level Set | | Type | Technical report | | Year | 2002 pp. 20 | | Publisher | Informatics and Mathematical Modelling, Technical University of Denmark, DTU | | Address | Richard Petersens Plads, Building 321, DK-2800 Kgs. Lyngby | | Series | IMM-TR-2002-21 | | Electronic version(s) | [pdf] | | BibTeX data | [bibtex] | | IMM Group(s) | Image Analysis & Computer Graphics |
|