Signed distance computation using the angle weighted pseudonormal

• Published in: IEEE transactions on visualization and computer graphics Vol. 11; no. 3; pp. 243 - 253
• Main Authors: Baerentzen, J.A., Aanaes, H.
• Format: Journal Article
• Language: English
• Published: United States IEEE 01.05.2005; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Algorithms; Computation; Computer Graphics; Computer Simulation; Geometry; Image Enhancement - methods; Image Interpretation, Computer-Assisted - methods; Imaging, Three-Dimensional - methods; Index Terms- Mesh; Information Storage and Retrieval - methods; Integrals; Loci; normal; Numerical Analysis, Computer-Assisted; Pattern Recognition, Automated - methods; polyhedron; Polyhedrons; pseudonormal; Robustness; Running; Signal Processing, Computer-Assisted; signed distance field; Studies; Triangles; Visualization
• ISSN: 1077-2626; 2160-9306; 1941-0506; 1941-0506
• DOI: 10.1109/TVCG.2005.49

The normals of closed, smooth surfaces have long been used to determine whether a point is inside or outside such a surface. It is tempting to also use this method for polyhedra represented as triangle meshes. Unfortunately, this is not possible since, at the vertices and edges of a triangle mesh, the surface is not C/sup 1/ continuous, hence, the normal is undefined at these loci. In this paper, we undertake to show that the angle weighted pseudonormal (originally proposed by Thurmer and Wuthrich and independently by Sequin) has the important property that it allows us to discriminate between points that are inside and points that are outside a mesh, regardless of whether a mesh vertex, edge, or face is the closest feature. This inside-outside information is usually represented as the sign in the signed distance to the mesh. In effect, our result shows that this sign can be computed as an integral part of the distance computation. Moreover, it provides an additional argument in favor of the angle weighted pseudonormals being the natural extension of the face normals. Apart from the theoretical results, we also propose a simple and efficient algorithm for computing the signed distance to a closed C/sup 0/ mesh. Experiments indicate that the sign computation overhead when running this algorithm is almost negligible.