Article

Interactive 3D distance field computation using linear factorization

Authors:

Naga Govindaraju,

Dinesh ManochaAuthors Info & Claims

I3D '06: Proceedings of the 2006 symposium on Interactive 3D graphics and games

Pages 117 - 124

https://doi.org/10.1145/1111411.1111432

Published: 14 March 2006 Publication History

Abstract

We present an interactive algorithm to compute discretized 3D Euclidean distance fields. Given a set of piecewise linear geometric primitives, our algorithm computes the distance field for each slice of a uniform spatial grid. We express the non-linear distance function of each primitive as a dot product of linear factors. The linear terms are efficiently computed using texture mapping hardware. We also improve the performance by using culling techniques that reduce the number of distance function evaluations using bounds on Voronoi regions of the primitives. Our algorithm involves no preprocessing and is able to handle complex deforming models at interactive rates. We have implemented our algorithm on a PC with NVIDIA GeForce 7800 GPU and applied it to models composed of thousands of triangles. We demonstrate its application to medial axis approximation and proximity computations between rigid and deformable models. In practice, our algorithm is more accurate and almost one order of magnitude faster as compared to previous distance computation algorithms that use graphics hardware.

References

[1]

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

Digital Library

[2]

Bolz, J., Farmer, I., Grinspun, E., and Schröder, P. 2003. Sparse matrix solvers on the gpu: Conjugate gradients and multigrid. ACM Trans. on Graphics (Proc. of ACM SIGGRAPH) 22, 3.

Digital Library

[3]

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

Digital Library

[4]

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

[5]

Culver, T., Keyser, J., and Manocha, D. 1998. Accurate computation of the medial axis of a polyhedron. Tech. Rep. TR98-034, Department of Computer Science, University of North Carolina. Appeared in Proceedings of ACM Solid Modeling 99.

Digital Library

[6]

Culver, T. 2000. Accurate Computation of the Medial Axis of a Polyhedron. PhD thesis, Department of Computer Science, University of North Carolina at Chapel Hill.

[7]

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

[8]

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

[9]

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

Digital Library

[10]

Foskey, M., Lin, M., and Manocha, D. 2003. Efficient computation of a simplified medial axis. Proc. of ACM Solid Modeling, 96--107.

Digital Library

[11]

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

Digital Library

[12]

Guthe, M., Balazs, A., and Klein, R. 2005. Gpu-based trimming and tessellation of nurbs and t-spline surfaces. ACM Trans. Graph. 24, 3, 1016--1023.

Digital Library

[13]

Hoff, III, K. E., Culver, T., Keyser, J., Lin, M., and Manocha, D. 1999. Fast computation of generalized Voronoi diagrams using graphics hardware. In Computer Graphics Annual Conference Series (SIGGRAPH '99), 277--286.

Digital Library

[14]

Hoff, K., Zaferakis, A., Lin, M., and Manocha, D. 2001. Fast and simple 2d geometric proximity queries using graphics hardware. Proc. of ACM Symposium on Interactive 3D Graphics, 145--148.

Digital Library

[15]

Kanai, T., and Yasui, Y. 2004. Per-pixel evaluation of parametric surfaces on gpu. ACM Workshop on General Purpose Computing on Graphics Processors.

[16]

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

Digital Library

[17]

Loop, C., and Blinn, J. 2005. Resolution independent curve rendering using programmable graphics hardware. ACM Trans. Graph. 24. 3, 1000--1009.

Digital Library

[18]

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

Digital Library

[19]

Maurer, C., Qi, R., and Raghavan, V. 2003. 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 (February), 265--270.

Digital Library

[20]

Peikert, R., and Sigg, C. 2005. Optimized bounding polyhedra for gpu-based distance transform. In Proceedings of Dagstuhl Seminar os Scientific Visualization.

[21]

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

Digital Library

[22]

Purcell., T., Donner, C., Cammarano, M., Jensen, H., and Hanrahan, P. 2003. Photon mapping on programmable graphics hardware. ACM SIGGRAPH/Eurographics Conference on Graphics Hardware, 41--50.

Digital Library

[23]

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

[24]

Shekhar, R., Fayyad, E., Yagel, R., and Cornhill., F. 1996. Octree-based decimation of marching cubes surfaces. Proc. of IEEE Visualization, 335--342.

Digital Library

[25]

Shiue, L.-J., Jones, I., and Peters, J. 2005. A realtime gpu subdivision kernel. ACM Trans. Graph. 24, 3, 1010--1015.

Digital Library

[26]

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

Digital Library

[27]

Sud, A., Otaduy, M. A., and Manocha, D. 2004. DiFi: Fast 3D distance field computation using graphics hardware. Computer Graphics Forum (Proc. Eurographics) 23, 3, 557--566.

[28]

Sud, A., Govindaraju, N., and Manocha, D. 2005. Interactive computation of discrete generalized voronoi diagrams using range culling. In Proc. International Symposium on Voronoi diagrams in Science and Engineering.

[29]

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

[30]

Varadhan, G., Krishnan, S., Kim, Y., and Manocha, D. 2003. Feature-sensitive subdivision and isosurface reconstruction. Proc. of IEEE Visualization.

Digital Library

[31]

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

[32]

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

Cited By

Pujol EChica A(2023)Triangle Influence Supersets for Fast Distance ComputationComputer Graphics Forum10.1111/cgf.1486142:6Online publication date: 6-Jun-2023
https://doi.org/10.1111/cgf.14861
Pujol EChica A(2023)Adaptive approximation of signed distance fields through piecewise continuous interpolationComputers & Graphics10.1016/j.cag.2023.06.020114(337-346)Online publication date: Aug-2023
https://doi.org/10.1016/j.cag.2023.06.020
Morgenroth DReinhardt SWeiskopf DEberhardt BLevin DKry P(2020)Efficient 2D simulation on moving 3D surfacesProceedings of the ACM SIGGRAPH/Eurographics Symposium on Computer Animation10.1111/cgf.14098(1-12)Online publication date: 6-Oct-2020
https://dl.acm.org/doi/10.1111/cgf.14098
Show More Cited By

Index Terms

Interactive 3D distance field computation using linear factorization

Recommendations

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 ...
3D Distance Fields: A Survey of Techniques and Applications

A distance field is a representation where, at each point within the field, we know the distance from that point to the closest point on any object within the domain. In addition to distance, other properties may be derived from the distance field, such ...
Skeleton-guided 3D shape distance field metamorphosis

Display Omitted We introduce an automatic 3D shape morphing method without the need of manually placing anchor correspondence points. Given a source and a target shape, we extract their skeletons and automatically estimate the meaningful anchor points ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

I3D '06: Proceedings of the 2006 symposium on Interactive 3D graphics and games

March 2006

231 pages

ISBN:159593295X

DOI:10.1145/1111411

Program Chairs:
Marc Olano,
Carlo Séquin

Copyright © 2006 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

SIGGRAPH: ACM Special Interest Group on Computer Graphics and Interactive Techniques

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 14 March 2006

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Acceptance Rates

Overall Acceptance Rate 148 of 485 submissions, 31%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

79
Total Citations
View Citations
891
Total Downloads

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

Reflects downloads up to 26 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

Pujol EChica A(2023)Triangle Influence Supersets for Fast Distance ComputationComputer Graphics Forum10.1111/cgf.1486142:6Online publication date: 6-Jun-2023
https://doi.org/10.1111/cgf.14861
Pujol EChica A(2023)Adaptive approximation of signed distance fields through piecewise continuous interpolationComputers & Graphics10.1016/j.cag.2023.06.020114(337-346)Online publication date: Aug-2023
https://doi.org/10.1016/j.cag.2023.06.020
Morgenroth DReinhardt SWeiskopf DEberhardt BLevin DKry P(2020)Efficient 2D simulation on moving 3D surfacesProceedings of the ACM SIGGRAPH/Eurographics Symposium on Computer Animation10.1111/cgf.14098(1-12)Online publication date: 6-Oct-2020
https://dl.acm.org/doi/10.1111/cgf.14098
Friston SSteed A(2019)Real-Time Collision Detection for Deformable Characters with Radial FieldsIEEE Transactions on Visualization and Computer Graphics10.1109/TVCG.2018.285992425:8(2611-2622)Online publication date: 1-Aug-2019
https://doi.org/10.1109/TVCG.2018.2859924
Manduhu MJones M(2019)A Work Efficient Parallel Algorithm for Exact Euclidean Distance TransformIEEE Transactions on Image Processing10.1109/TIP.2019.291674128:11(5322-5335)Online publication date: Nov-2019
https://doi.org/10.1109/TIP.2019.2916741
Krayer BMüller S(2019)Generating signed distance fields on the GPU with ray mapsThe Visual Computer: International Journal of Computer Graphics10.1007/s00371-019-01683-w35:6-8(961-971)Online publication date: 1-Jun-2019
https://dl.acm.org/doi/10.1007/s00371-019-01683-w
Tang DDou MLincoln PDavidson PGuo KTaylor JFanello SKeskin CKowdle ABouaziz SIzadi STagliasacchi A(2018)Real-time compression and streaming of 4D performancesACM Transactions on Graphics10.1145/3272127.327509637:6(1-11)Online publication date: 4-Dec-2018
https://dl.acm.org/doi/10.1145/3272127.3275096
Yue YSmith BChen PChantharayukhonthorn MKamrin KGrinspun E(2018)Hybrid grainsACM Transactions on Graphics10.1145/3272127.327509537:6(1-19)Online publication date: 4-Dec-2018
https://dl.acm.org/doi/10.1145/3272127.3275095
Wang XKoch SHolmqvist KAlexa M(2018)Tracking the gaze on objects in 3DACM Transactions on Graphics10.1145/3272127.327509437:6(1-18)Online publication date: 4-Dec-2018
https://dl.acm.org/doi/10.1145/3272127.3275094
Cao CChai MWoodford OLuo L(2018)Stabilized real-time face tracking via a learned dynamic rigidity priorACM Transactions on Graphics10.1145/3272127.327509337:6(1-11)Online publication date: 4-Dec-2018
https://dl.acm.org/doi/10.1145/3272127.3275093
Show More Cited By

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