The vector distance transform in two and three dimensions
CVGIP: Graphical Models and Image Processing
Three-dimensional distance field metamorphosis
ACM Transactions on Graphics (TOG)
Two fast Euclidean distance transformations in Z2 based on sufficient propagation
Computer Vision and Image Understanding
Using distance maps for accurate surface representation in sampled volumes
VVS '98 Proceedings of the 1998 IEEE symposium on Volume visualization
Fast computation of generalized Voronoi diagrams using graphics hardware
Proceedings of the 26th annual conference on Computer graphics and interactive techniques
Adaptively sampled distance fields: a general representation of shape for computer graphics
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
Distance-field based skeletons for virtual navigation
Proceedings of the conference on Visualization '01
A complete distance field representation
Proceedings of the conference on Visualization '01
Fast Ray-Tracing of Rectilinear Volume Data Using Distance Transforms
IEEE Transactions on Visualization and Computer Graphics
IEEE Transactions on Pattern Analysis and Machine Intelligence
Efficient algorithms for solving static hamilton-jacobi equations
Efficient algorithms for solving static hamilton-jacobi equations
VIS '04 Proceedings of the conference on Visualization '04
Signed Distance Computation Using the Angle Weighted Pseudonormal
IEEE Transactions on Visualization and Computer Graphics
IEEE Transactions on Visualization and Computer Graphics
Interactive 3D distance field computation using linear factorization
I3D '06 Proceedings of the 2006 symposium on Interactive 3D graphics and games
A higher dimensional formulation for robust and interactive distance queries
Proceedings of the 2006 ACM symposium on Solid and physical modeling
Fast proximity computation among deformable models using discrete Voronoi diagrams
ACM SIGGRAPH 2006 Papers
3D distance transform adaptive filtering for smoothing and denoising triangle meshes
Proceedings of the 4th international conference on Computer graphics and interactive techniques in Australasia and Southeast Asia
GI '07 Proceedings of Graphics Interface 2007
Programmable shaders for deformation rendering
Proceedings of the 22nd ACM SIGGRAPH/EUROGRAPHICS symposium on Graphics hardware
Embedded real-time architecture for level-set-based active contours
EURASIP Journal on Applied Signal Processing
IEEE Transactions on Visualization and Computer Graphics
Layer-Based Representation of Polyhedrons for Point Containment Tests
IEEE Transactions on Visualization and Computer Graphics
Single-pass GPU solid voxelization for real-time applications
GI '08 Proceedings of graphics interface 2008
Parallel algorithms for approximation of distance maps on parametric surfaces
ACM Transactions on Graphics (TOG)
New sequential exact Euclidean distance transform algorithms based on convex analysis
Image and Vision Computing
Technical Section: Visual computing for medical diagnosis and treatment
Computers and Graphics
Enhanced physically-based animation of deformable bodies using shape-matching
Computers in Entertainment (CIE) - SPECIAL ISSUE: Games
Novel geometrical voxelization approach with application to streamlines
Journal of Computer Science and Technology
Harmonic field based volume model construction from triangle soup
Journal of Computer Science and Technology
Skeletonization and distance transforms of 3D volumes using graphics hardware
DGCI'06 Proceedings of the 13th international conference on Discrete Geometry for Computer Imagery
Generalized distance transforms and skeletons in graphics hardware
VISSYM'04 Proceedings of the Sixth Joint Eurographics - IEEE TCVG conference on Visualization
Robust generation of signed distance fields from triangle meshes
VG'05 Proceedings of the Fourth Eurographics / IEEE VGTC conference on Volume Graphics
Particle level set advection for the interactive visualization of unsteady 3D flow
EuroVis'08 Proceedings of the 10th Joint Eurographics / IEEE - VGTC conference on Visualization
Computing local signed distance fields for large polygonal models
EuroVis'08 Proceedings of the 10th Joint Eurographics / IEEE - VGTC conference on Visualization
EuroVis'10 Proceedings of the 12th Eurographics / IEEE - VGTC conference on Visualization
Enclosing surfaces for point clusters using 3d discrete voronoi diagrams
EuroVis'09 Proceedings of the 11th Eurographics / IEEE - VGTC conference on Visualization
PixelPie: maximal Poisson-disk sampling with rasterization
Proceedings of the 5th High-Performance Graphics Conference
CHOMP: Covariant Hamiltonian optimization for motion planning
International Journal of Robotics Research
Geometry-shader-based real-time voxelization and applications
The Visual Computer: International Journal of Computer Graphics
Hi-index | 0.00 |
This paper presents a signed distance transform algorithm using graphics hardware, which computes the scalar valued function of the Euclidean distance to a given manifold of co-dimension one. If this manifold is closed and orientable, the distance has a negative sign on one side of the manifold and a positive sign on the other. Triangle meshes are considered for the representation of a two-dimensional manifold and the distance function is sampled on a regular Cartesian grid. In order to achieve linear complexity in the number of grid points, to each primitive we assign a simple poly-hedron enclosing its Voronoi cell. Voronoi cells are known to contain exactly all points that lay closest to its corresponding primitive. Thus, the distance to the primitive only has to be computed for grid points inside its polyhedron. Although Voronoi cells partition space, the polyhedrons enclosing these cells do overlap. In regions where these overlaps occur, the minimum of all computed distances is assigned to a grid point. In order to speed up computations, points inside each polyhedron are determined by scan conversion of grid slices using graphics hardware. For this task, a fragment program is used to perform the nonlinear interpolation and minimization of distance values.