SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
OBBTree: a hierarchical structure for rapid interference detection
SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
Three-dimensional distance field metamorphosis
ACM Transactions on Graphics (TOG)
Parameter-controlled volume thinning
CVGIP: Graphical Models and Image Processing
Adaptively sampled distance fields: a general representation of shape for computer graphics
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
'Meshsweeper': Dynamic Point-to-Polygonal-Mesh Distance and Applications
IEEE Transactions on Visualization and Computer Graphics
Robust Creation of Implicit Surfaces from Polygonal Meshes
IEEE Transactions on Visualization and Computer Graphics
SM '03 Proceedings of the eighth ACM symposium on Solid modeling and applications
Multi-level partition of unity implicits
ACM SIGGRAPH 2003 Papers
Nonconvex rigid bodies with stacking
ACM SIGGRAPH 2003 Papers
Robust repair of polygonal models
ACM SIGGRAPH 2004 Papers
Signed Distance Computation Using the Angle Weighted Pseudonormal
IEEE Transactions on Visualization and Computer Graphics
Space–time blending: Research Articles
Computer Animation and Virtual Worlds
Real-Time Collision Detection (The Morgan Kaufmann Series in Interactive 3-D Technology) (The Morgan Kaufmann Series in Interactive 3D Technology)
3D Distance Fields: A Survey of Techniques and Applications
IEEE Transactions on Visualization and Computer Graphics
Procedural function-based modelling of volumetric microstructures
Graphical Models
Shallow bounding volume hierarchies for fast SIMD ray tracing of incoherent rays
EGSR'08 Proceedings of the Nineteenth Eurographics conference on Rendering
| Hi-index | 0.00 |
An efficient representation of a polygonal mesh by a signed continuous distance field is the main focus of this work. We compare different approaches to implementing such a representation and choose the most efficient one. Several optimizations to the existing methods are presented including the new traversal technique for the BVH-based signed distance evaluation and packet queries. We also discuss details of the GPU implementation of the efficient signed distance evaluation. Several application examples are presented such as blending set operations, linear metamorphosis, space-time blending and microstructure generation for polygonal meshes.