Computing surface normals for 3D models
Graphics gems
Computer graphics (2nd ed. in C): principles and practice
Computer graphics (2nd ed. in C): principles and practice
Robust adaptive floating-point geometric predicates
Proceedings of the twelfth annual symposium on Computational geometry
Computing vertex normals from polygonal facets
Journal of Graphics Tools
Weights for computing vertex normals from facet normals
Journal of Graphics Tools
Adaptively sampled distance fields: a general representation of shape for computer graphics
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
Dynamic simulations of multibody systems
Dynamic simulations of multibody systems
A complete distance field representation
Proceedings of the conference on Visualization '01
'Meshsweeper': Dynamic Point-to-Polygonal-Mesh Distance and Applications
IEEE Transactions on Visualization and Computer Graphics
Distance Field Manipulation of Surface Models
IEEE Computer Graphics and Applications
A Robust Procedure to Eliminate Degenerate Faces from Triangle Meshes
VMV '01 Proceedings of the Vision Modeling and Visualization Conference 2001
On visible surface generation by a priori tree structures
SIGGRAPH '80 Proceedings of the 7th annual conference on Computer graphics and interactive techniques
Geometric Level Set Methods in Imaging,Vision,and Graphics
Geometric Level Set Methods in Imaging,Vision,and Graphics
Nonconvex rigid bodies with stacking
ACM SIGGRAPH 2003 Papers
Collision queries using oriented bounding boxes
Collision queries using oriented bounding boxes
Efficient algorithms for solving static hamilton-jacobi equations
Efficient algorithms for solving static hamilton-jacobi equations
Signed Distance Transform Using Graphics Hardware
Proceedings of the 14th IEEE Visualization 2003 (VIS'03)
An immersed boundary method for complex incompressible flows
Journal of Computational Physics
SCA '07 Proceedings of the 2007 ACM SIGGRAPH/Eurographics symposium on Computer animation
Contact trees: adaptive contact sampling for robust dynamics
ACM SIGGRAPH 2007 sketches
Layer-Based Representation of Polyhedrons for Point Containment Tests
IEEE Transactions on Visualization and Computer Graphics
An anisotropic scale-invariant unstructured mesh generator suitable for volumetric imaging data
Journal of Computational Physics
Improved Two-Level Model Averaging Techniques in Drosophila Brain Modeling
PSIVT '09 Proceedings of the 3rd Pacific Rim Symposium on Advances in Image and Video Technology
Numerical Simulation of the Electromechanical Activity of the Heart
FIMH '09 Proceedings of the 5th International Conference on Functional Imaging and Modeling of the Heart
Line-stepping for shell meshes
SCIA'07 Proceedings of the 15th Scandinavian conference on Image analysis
Surface-to-surface registration using level sets
SCIA'07 Proceedings of the 15th Scandinavian conference on Image analysis
Analysis of deformation of the human ear and canal caused by mandibular movement
MICCAI'07 Proceedings of the 10th international conference on Medical image computing and computer-assisted intervention
Cone carving for surface reconstruction
ACM SIGGRAPH Asia 2010 papers
A new point containment test algorithm based on preprocessing and determining triangles
Computer-Aided Design
OverCoat: an implicit canvas for 3D painting
ACM SIGGRAPH 2011 papers
Robust generation of signed distance fields from triangle meshes
VG'05 Proceedings of the Fourth Eurographics / IEEE VGTC conference on Volume Graphics
Computing local signed distance fields for large polygonal models
EuroVis'08 Proceedings of the 10th Joint Eurographics / IEEE - VGTC conference on Visualization
Efficient evaluation of continuous signed distance to a polygonal mesh
Proceedings of the 28th Spring Conference on Computer Graphics
A lattice boltzmann simulation of hemodynamics in a patient-specific aortic coarctation model
STACOM'12 Proceedings of the third international conference on Statistical Atlases and Computational Models of the Heart: imaging and modelling challenges
A framework for hybrid parallel flow simulations with a trillion cells in complex geometries
SC '13 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis
Robust realtime physics-based motion control for human grasping
ACM Transactions on Graphics (TOG)
Flow analysis in cardiac chambers combining phase contrast, 3D tagged and cine MRI
FIMH'13 Proceedings of the 7th international conference on Functional Imaging and Modeling of the Heart
Technical Section: A unified smoke control method based on signed distance field
Computers and Graphics
Coarse-to-fine skeleton extraction for high resolution 3D meshes
Computer Vision and Image Understanding
| Hi-index | 0.01 |
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^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 Thürmer and Wüthrich and independently by Séquin) 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^0 mesh. Experiments indicate that the sign computation overhead when running this algorithm is almost negligible.