Voronoi diagrams—a survey of a fundamental geometric data structure
ACM Computing Surveys (CSUR)
Fast computation of generalized Voronoi diagrams using graphics hardware
Proceedings of the 26th annual conference on Computer graphics and interactive techniques
SIAM Review
A continuous skeletonization method based on level sets
VISSYM '02 Proceedings of the symposium on Data Visualisation 2002
An augmented Fast Marching Method for computing skeletons and centerlines
VISSYM '02 Proceedings of the symposium on Data Visualisation 2002
Efficient computation of a simplified medial axis
SM '03 Proceedings of the eighth ACM symposium on Solid modeling and applications
ICCV '99 Proceedings of the International Conference on Computer Vision-Volume 2 - Volume 2
Multiscale Medial Loci and Their Properties
International Journal of Computer Vision - Special Issue on Research at the University of North Carolina Medical Image Display Analysis Group (MIDAG)
Fast image segmentation and smoothing using commodity graphics hardware
Journal of Graphics Tools - Special on hardware-accelerated rendering techniques
Efficient algorithms for solving static hamilton-jacobi equations
Efficient algorithms for solving static hamilton-jacobi equations
Interactive Deformation and Visualization of Level Set Surfaces Using Graphics Hardware
Proceedings of the 14th IEEE Visualization 2003 (VIS'03)
Signed Distance Transform Using Graphics Hardware
Proceedings of the 14th IEEE Visualization 2003 (VIS'03)
Visualization of generalized voronoi diagrams
EGVISSYM'01 Proceedings of the 3rd Joint Eurographics - IEEE TCVG conference on Visualization
Real-Time Motion Estimation and Visualization on Graphics Cards
VIS '04 Proceedings of the conference on Visualization '04
Jump flooding in GPU with applications to Voronoi diagram and distance transform
I3D '06 Proceedings of the 2006 symposium on Interactive 3D graphics and games
Glift: Generic, efficient, random-access GPU data structures
ACM Transactions on Graphics (TOG)
Analysis of Relevant Maxima in Distance Transform. An Application to Fast Coarse Image Segmentation
IbPRIA '07 Proceedings of the 3rd Iberian conference on Pattern Recognition and Image Analysis, Part I
GpuCV: A GPU-Accelerated Framework for Image Processing and Computer Vision
ISVC '08 Proceedings of the 4th International Symposium on Advances in Visual Computing, Part II
Hand geometry analysis by continuous skeletons
ICIAR'11 Proceedings of the 8th international conference on Image analysis and recognition - Volume Part II
Skeletonization and distance transforms of 3D volumes using graphics hardware
DGCI'06 Proceedings of the 13th international conference on Discrete Geometry for Computer Imagery
TGI-EB: a new framework for edge bundling integrating topology, geometry and importance
GD'11 Proceedings of the 19th international conference on Graph Drawing
GPU accelerated image processing for lip segmentation
PPAM'11 Proceedings of the 9th international conference on Parallel Processing and Applied Mathematics - Volume Part I
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
Image-based edge bundles: simplified visualization of large graphs
EuroVis'10 Proceedings of the 12th Eurographics / IEEE - VGTC conference on Visualization
ViviSection: skeleton-based volume editing
EuroVis '13 Proceedings of the 15th Eurographics Conference on Visualization
| Hi-index | 0.00 |
We present a framework for computing generalized distance transforms and skeletons of two-dimensional objects using graphics hardware. Our method is based on the concept of footprint splatting. Combining different splats produces weighted distance transforms for different metrics, as well as the corresponding skeletons and Voronoi diagrams. We present a hierarchical acceleration scheme and a subdivision scheme that allows visualizing the computed skeletons with subpixel accuracy in real time. Our splatting approach allows one to easily change all the metric parameters, treat any 2D boundaries, and easily produce both DTs and skeletons. We illustrate the method by several examples.