Article

Surface distance maps

Authors:

Naga Govindaraju,

Dinesh ManochaAuthors Info & Claims

GI '07: Proceedings of Graphics Interface 2007

Pages 35 - 42

https://doi.org/10.1145/1268517.1268525

Published: 28 May 2007 Publication History

Abstract

We present a new parameterized representation called surface distance maps for distance computations on piecewise 2-manifold primitives. Given a set of orientable 2-manifold primitives, the surface distance map represents the (non-zero) signed distance-to-closest-primitive mapping at each point on a 2-manifold. The distance mapping is computed from each primitive to the set of remaining primitives. We present an interactive algorithm for computing the surface distance map of triangulated meshes using graphics hardware. We precompute a surface parameterization and use the it to define an affine transformation for each mesh primitive. Our algorithm efficiently computes the distance field by applying this affine transformation to the distance functions of the primitives and evaluating these functions using texture mapping hardware. In practice, our algorithm can compute very high resolution surface distance maps at interactive rates and provides tight error bounds on their accuracy. We use surface distance maps for path planning and proximity query computation among complex models in dynamic environments. Our approach can perform planning and proximity queries in a dynamic environment with hundreds of objects at interactive rates and offer significant speedups over prior algorithms.

References

[1]

F. Aurenhammer. Voronoi diagrams: A survey of a fundamental geometric data structure. ACM Comput. Surv., 23(3):345--405, September 1991.

Digital Library

[2]

I. Bitter, A. Kaufmann, and M. Sato. Penalized-distance volumetric skeleton algorithm. IEEE Trans. on Visualization and Computer Graphics, 7(3), 2001.

Digital Library

[3]

J. F. Blinn. Simulation of wrinkled surfaces. In Computer Graphics (SIGGRAPH '78 Proceedings), pages 286--292, 1978.

Digital Library

[4]

H. Breu, J. Gil, D. Kirkpatrick, and M. Werman. Linear time Euclidean distance transform and Voronoi diagram algorithms. IEEE Trans. Pattern Anal. Mach. Intell., 17:529--533, 1995.

Digital Library

[5]

E. Catmull. A subdivision algorithm for computer display of curved surfaces. PhD thesis, University of Utah, 1974.

Digital Library

[6]

H. Choset and J. Burdick. Sensor based motion planning: The hierarchical generalized Voronoi graph. In Algorithms for Robot Motion and Manipulation, pages 47--61. A K Peters, 1996.

[7]

Robert L. Cook. Shade trees. In Hank Christiansen, editor, Computer Graphics (SIGGRAPH '84 Proceedings), volume 18, pages 223--231, July 1984.

Digital Library

[8]

O. Cuisenaire. Distance Transformations: Fast Algorithms and Applications to Medical Image Processing. PhD thesis, Universite Catholique de Louvain, 1999.

[9]

P. E. Danielsson. Euclidean distance mapping. Computer Graphics and Image Processing, 14:227--248, 1980.

[10]

M. Denny. Solving geometric optimization problems using graphics hardware. Computer Graphics Forum, 22(3), 2003.

[11]

Michal Etzion and Ari Rappoport. Computing Voronoi skeletons of a 3-d polyhedron by space subdivision. Computational Geometry: Theory and Applications, 21(3):87--120, March 2002.

Digital Library

[12]

I. Fischer and C. Gotsman. Fast approximation of high order Voronoi diagrams and distance transforms on the GPU. Technical report CS TR-07-05, Harvard University, 2005.

[13]

M. Foskey, M. Garber, M. Lin, and D. Manocha. A voronoi-based hybrid planner. Proc. of IEEE/RSJ Int. Conf. on Intelligent Robots and Systems, 2001.

[14]

Alain Fournier. Normal distribution functions and multiple surfaces. In Graphics Interface '92 Workshop on Local Illumination, pages 45--52, May 1992.

[15]

S. Frisken, R. Perry, A. Rockwood, and R. Jones. Adaptively sampled distance fields: A general representation of shapes for computer graphics. In Proc. of ACM SIGGRAPH, pages 249--254, 2000.

Digital Library

[16]

S. Gibson. Using distance maps for smooth representation in sampled volumes. In Proc. of IEEE Volume Visualization Symposium, pages 23--30, 1998.

Digital Library

[17]

J. Gomes and O. Faugeras. The vector distance functions. Int. Journal of Computer Vision, 52(2):161--187, 2003.

Digital Library

[18]

K. Hoff, T. Culver, J. Keyser, M. Lin, and D. Manocha. Interactive motion planning using hardware accelerated computation of generalized voronoi diagrams. Proceedings of IEEE Conference of Robotics and Automation, 2000.

[19]

Kenneth E. Hoff, III, Tim Culver, John Keyser, Ming Lin, and Dinesh Manocha. Fast computation of generalized Voronoi diagrams using graphics hardware. In Computer Graphics Annual Conference Series (SIGGRAPH '99), pages 277--286, 1999.

Digital Library

[20]

A. Klein, P. J. Sloan, A. Finkelstein, and M. Cohen. Stylized video cubes. Symposium on Computer Animation, 1992.

Digital Library

[21]

L. Kobbelt, M. Botsch, U. Schwanecke, and H. P. Seidel. Feature-sensitive surface extraction from volume data. In Proc. of ACM SIGGRAPH, pages 57--66, 2001.

Digital Library

[22]

A. Lefohn, J. Kniss, C. D. Hansen, and R. Whitaker. Interactive deformation and visualization of level set surfaces using graphics hardware. In Proceedings of IEEE Visualization, page To Appear, 2003.

Digital Library

[23]

M. C. Lin. Efficient Collision Detection for Animation and Robotics. PhD thesis, Department of Electrical Engineering and Computer Science, University of California, Berkeley, December 1993.

Digital Library

[24]

Sean Mauch. Efficient Algorithms for Solving Static Hamilton-Jacobi Equations. PhD thesis, Californa Institute of Technology, 4 2003.

Digital Library

[25]

C. R. Maurer, R. Qi, and V. Raghavan. A linear time algorithm for computing exact euclidean distance transforms of binary images in arbitary dimensions. IEEE Transactions on Pattern Analysis and Machine Intelligence, 25(2):265--270, February 2003.

Digital Library

[26]

Atsuyuki Okabe, Barry Boots, and Kokichi Sugihara. Spatial Tessellations: Concepts and Applications of Voronoi Diagrams. John Wiley & Sons, Chichester, UK, 1992.

Digital Library

[27]

R. Peikert and C. Sigg. Optimized bounding polyhedra for gpu-based distance transform. In Scientific Visualization: The visual extraction of knowledge from data, 2005.

[28]

R. Perry and S. Frisken. Kizamu: A system for sculpting digital characters. In Proc. of ACM SIGGRAPH, pages 47--56, 2001.

Digital Library

[29]

J. A. Sethian. Level set methods and fast marching methods. Cambridge, 1999.

[30]

C. Sigg, R. Peikert, and M. Gross. Signed distance transform using graphics hardware. In Proceedings of IEEE Visualization, pages 83--90, 2003.

Digital Library

[31]

A. Sud, N. Govindaraju, R. Gayle, and D. Manocha. Interactive 3d distance field computation using linear factorization. In Proc. ACM Symposium on Interactive 3D Graphics and Games, pages 117--124, 2006.

Digital Library

[32]

Avneesh Sud, Naga Govindaraju, Russell Gayle, Ilknur Kabul, and Dinesh Manocha. Fast proximity computation among deformable models using discrete voronoi diagrams. ACM Trans. Graph. (Proc ACM SIGGRAPH), 25(3):1144--1153, 2006.

Digital Library

[33]

L. Szirmay-Kalos, B. Aszodi, I. Lazanyi, and M. Premecz. Approximate ray-tracing on the gpu with distance impostor. Proc. of Eurographics, 2005.

[34]

M. Teichmann and S. Teller. Polygonal approximation of Voronoi diagrams of a set of triangles in three dimensions. Technical Report 766, Laboratory of Computer Science, MIT, 1997.

[35]

J. Vleugels and M. H. Overmars. Approximating Voronoi diagrams of convex sites in any dimension. International Journal of Computational Geometry and Applications, 8:201--222, 1998.

[36]

M. Woo, J. Neider, and T. Davis. OpenGL Programming Guide, Second Edition. Addison Wesley, 1997.

Cited By

Borunda-Aguilar MPérez-Olguín IOchoa-Zezzatti AMartinez-Gomez EHernández J(2021)Evacuation Route Optimization in the Plaza de la Mexicanidad, Using Humanitarian LogisticsTechnological and Industrial Applications Associated With Industry 4.010.1007/978-3-030-68663-5_3(41-56)Online publication date: 2-Jul-2021
https://doi.org/10.1007/978-3-030-68663-5_3
Xu HBarbič JKry PBunt A(2014)Signed distance fields for polygon soup meshesProceedings of Graphics Interface 201410.5555/2619648.2619655(35-41)Online publication date: 7-May-2014
https://dl.acm.org/doi/10.5555/2619648.2619655
De Gyves OToledo LRudomín IMcDonnell RSturtevant NZordan V(2013)Proximity Queries for Crowd Simulation Using Truncated Voronoi DiagramsProceedings of Motion on Games10.1145/2522628.2522657(87-92)Online publication date: 6-Nov-2013
https://dl.acm.org/doi/10.1145/2522628.2522657
Show More Cited By

Index Terms

Surface distance maps
1. Computing methodologies
  1. Computer graphics
2. Theory of computation
  1. Randomness, geometry and discrete structures

Recommendations

Computing Extremal Quasiconformal Maps

Conformal maps are widely used in geometry processing applications. They are smooth, preserve angles, and are locally injective by construction. However, conformal maps do not allow for boundary positions to be prescribed. A natural extension to the ...
GPU-Based Feature-Preserving Distance Field Computation
CW '08: Proceedings of the 2008 International Conference on Cyberworlds

We present an optimized algorithm to compute 3D distance fields using the bilinear interpolation capabilities of GPUs while preserving the features of the model. For a geometric model, our algorithm computes the Euclidean distance fields on each 2D ...
Foldover-free maps in 50 lines of code

Mapping a triangulated surface to 2D space (or a tetrahedral mesh to 3D space) is an important problem in geometry processing. In computational physics, untangling plays an important role in mesh generation: it takes a mesh as an input, and moves the ...

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences

GI '07: Proceedings of Graphics Interface 2007

May 2007

352 pages

ISBN:9781568813370

DOI:10.1145/1268517

Program Chairs:
Christopher G. Healey
North Carolina State University
,
Edward Lank
University of Waterloo

Copyright © 2007 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

CHCCS: The Canadian Human-Computer Communications Society

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 28 May 2007

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Acceptance Rates

Overall Acceptance Rate 206 of 508 submissions, 41%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

6
Total Citations
View Citations
505
Total Downloads

Downloads (Last 12 months)7
Downloads (Last 6 weeks)0

Reflects downloads up to 18 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

Borunda-Aguilar MPérez-Olguín IOchoa-Zezzatti AMartinez-Gomez EHernández J(2021)Evacuation Route Optimization in the Plaza de la Mexicanidad, Using Humanitarian LogisticsTechnological and Industrial Applications Associated With Industry 4.010.1007/978-3-030-68663-5_3(41-56)Online publication date: 2-Jul-2021
https://doi.org/10.1007/978-3-030-68663-5_3
Xu HBarbič JKry PBunt A(2014)Signed distance fields for polygon soup meshesProceedings of Graphics Interface 201410.5555/2619648.2619655(35-41)Online publication date: 7-May-2014
https://dl.acm.org/doi/10.5555/2619648.2619655
De Gyves OToledo LRudomín IMcDonnell RSturtevant NZordan V(2013)Proximity Queries for Crowd Simulation Using Truncated Voronoi DiagramsProceedings of Motion on Games10.1145/2522628.2522657(87-92)Online publication date: 6-Nov-2013
https://dl.acm.org/doi/10.1145/2522628.2522657
Nivoliers VLévy BFalcidieno BSpagnuolo MLipman YZhang H(2013)Approximating functions on a mesh with restricted Voronoï diagramsProceedings of the Eleventh Eurographics/ACMSIGGRAPH Symposium on Geometry Processing10.1111/cgf.12175(83-92)Online publication date: 3-Jul-2013
https://dl.acm.org/doi/10.1111/cgf.12175
Scheer FMarschner MMüller S(2010)Short paperProceedings of the 16th Eurographics conference on Virtual Environments & Second Joint Virtual Reality10.5555/2386062.2386080(85-88)Online publication date: 27-Sep-2010
https://dl.acm.org/doi/10.5555/2386062.2386080
Chang BCha DIhm I(2008)Computing local signed distance fields for large polygonal modelsProceedings of the 10th Joint Eurographics / IEEE - VGTC conference on Visualization10.1111/j.1467-8659.2008.01210.x(799-806)Online publication date: 26-May-2008
https://dl.acm.org/doi/10.1111/j.1467-8659.2008.01210.x

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents