Parallel algorithms for approximation of distance maps on parametric surfaces

Authors:
Ofir Weber;Yohai S. Devir;Alexander M. Bronstein;Michael M. Bronstein;Ron Kimmel
Affiliations:
Technion Israel Institute of Technology;Technion Israel Institute of Technology;Technion Israel Institute of Technology;Technion Israel Institute of Technology;Technion Israel Institute of Technology
Venue:
ACM Transactions on Graphics (TOG)
Year:
2008

Citing 20
Cited 23

The discrete geodesic problem

SIAM Journal on Computing
Robust mesh watermarking

Proceedings of the 26th annual conference on Computer graphics and interactive techniques
Fast computation of generalized Voronoi diagrams using graphics hardware

Proceedings of the 26th annual conference on Computer graphics and interactive techniques
An Optimal Algorithm for Euclidean Shortest Paths in the Plane

SIAM Journal on Computing
Shape by example

I3D '01 Proceedings of the 2001 symposium on Interactive 3D graphics
Topology matching for fully automatic similarity estimation of 3D shapes

Proceedings of the 28th annual conference on Computer graphics and interactive techniques
Fast computation of weighted distance functions and geodesics on implicit hyper-surfaces: 730

Journal of Computational Physics
Geometry images

Proceedings of the 29th annual conference on Computer graphics and interactive techniques
Texture Mapping Using Surface Flattening via Multidimensional Scaling

IEEE Transactions on Visualization and Computer Graphics
Shape from Shading: Provably Convergent Algorithms and Uniqueness Results

ECCV '94 Proceedings of the Third European Conference-Volume II on Computer Vision - Volume II
Hierarchical mesh decomposition using fuzzy clustering and cuts

ACM SIGGRAPH 2003 Papers
Modeling by example

ACM SIGGRAPH 2004 Papers
Iso-charts: stretch-driven mesh parameterization using spectral analysis

Proceedings of the 2004 Eurographics/ACM SIGGRAPH symposium on Geometry processing
Fast exact and approximate geodesics on meshes

ACM SIGGRAPH 2005 Papers
Signed Distance Transform Using Graphics Hardware

Proceedings of the 14th IEEE Visualization 2003 (VIS'03)
Interactive 3D distance field computation using linear factorization

I3D '06 Proceedings of the 2006 symposium on Interactive 3D graphics and games
A Theoretical and Computational Framework for Isometry Invariant Recognition of Point Cloud Data

Foundations of Computational Mathematics
The phase flow method

Journal of Computational Physics
Rectangular multi-chart geometry images

SGP '06 Proceedings of the fourth Eurographics symposium on Geometry processing
Fast Sweeping Methods for Eikonal Equations on Triangular Meshes

SIAM Journal on Numerical Analysis

Topology-Invariant Similarity of Nonrigid Shapes

International Journal of Computer Vision
Three-dimensional point cloud recognition via distributions of geometric distances

Graphical Models
Energetic Path Finding across Massive Terrain Data

ISVC '09 Proceedings of the 5th International Symposium on Advances in Visual Computing: Part II
Technical Section: Emergency crowd simulation for outdoor environments

Computers and Graphics
A Gromov-Hausdorff Framework with Diffusion Geometry for Topologically-Robust Non-rigid Shape Matching

International Journal of Computer Vision
Geodesic image and video editing

ACM Transactions on Graphics (TOG)
Anisotropic blue noise sampling

ACM SIGGRAPH Asia 2010 papers
Geodesic Methods in Computer Vision and Graphics

Foundations and Trends® in Computer Graphics and Vision
Tubular Structure Segmentation Based on Minimal Path Method and Anisotropic Enhancement

International Journal of Computer Vision
Interactive and anisotropic geometry processing using the screened Poisson equation

ACM SIGGRAPH 2011 papers
Short Communication to SMI 2011: Affine-invariant geodesic geometry of deformable 3D shapes

Computers and Graphics
A survey of geodesic paths on 3D surfaces

Computational Geometry: Theory and Applications
Technical Section: Realistic modeling of spectator behavior for soccer videogames with CUDA

Computers and Graphics
Constant-time all-pairs geodesic distance query on triangle meshes

I3D '12 Proceedings of the ACM SIGGRAPH Symposium on Interactive 3D Graphics and Games
Measuring geodesic distances via the uniformization theorem

SSVM'11 Proceedings of the Third international conference on Scale Space and Variational Methods in Computer Vision
On the expected complexity of voronoi diagrams on terrains

Proceedings of the twenty-eighth annual symposium on Computational geometry
An intrinsic algorithm for computing geodesic distance fields on triangle meshes with holes

Graphical Models
Fast Two-scale Methods for Eikonal Equations

SIAM Journal on Scientific Computing
Dart throwing on surfaces

EGSR'09 Proceedings of the Twentieth Eurographics conference on Rendering
Saddle vertex graph (SVG): a novel solution to the discrete geodesic problem

ACM Transactions on Graphics (TOG)
Geodesics in heat: A new approach to computing distance based on heat flow

ACM Transactions on Graphics (TOG)
Parallel chen-han (PCH) algorithm for discrete geodesics

ACM Transactions on Graphics (TOG)
Practical anisotropic geodesy

SGP '13 Proceedings of the Eleventh Eurographics/ACMSIGGRAPH Symposium on Geometry Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present an efficient O(n) numerical algorithm for first-order approximation of geodesic distances on geometry images, where n is the number of points on the surface. The structure of our algorithm allows efficient implementation on parallel architectures. Two implementations on a SIMD processor and on a GPU are discussed. Numerical results demonstrate up to four orders of magnitude improvement in execution time compared to the state-of-the-art algorithms.