article

Fast proximity computation among deformable models using discrete Voronoi diagrams

Authors:

Naga Govindaraju,

Dinesh ManochaAuthors Info & Claims

ACM Transactions on Graphics (TOG), Volume 25, Issue 3

Pages 1144 - 1153

https://doi.org/10.1145/1141911.1142006

Published: 01 July 2006 Publication History

Abstract

We present novel algorithms to perform collision and distance queries among multiple deformable models in dynamic environments. These include inter-object queries between different objects as well as intra-object queries. We describe a unified approach to compute these queries based on N-body distance computation and use properties of the 2^nd order discrete Voronoi diagram to perform N-body culling. Our algorithms involve no preprocessing and also work well on models with changing topologies. We can perform all proximity queries among complex deformable models consisting of thousands of triangles in a fraction of a second on a high-end PC. Moreover, our Voronoi-based culling algorithm can improve the performance of separation distance and penetration queries by an order of magnitude.

Supplementary Material

JPG File (p1144-sud-high.jpg)

Download
16.62 KB

JPG File (p1144-sud-low.jpg)

Download
13.74 KB

High Resolution (p1144-sud-high.mov)

Download
57.00 MB

Low Resolution (p1144-sud-low.mov)

Download
20.42 MB

References

[1]

Agarwal, P., Guibas, L., Nguyen, A., Russel, D., and Zhang, L. 2004. Collision detection for deforming necklaces. Computational Geometry: Theory and Applications 28, 2-3, 137--163.

Digital Library

[2]

Baraff, D., and Witkin, A. 2001. Physically Based Modeling. ACM SIGGRAPH Course Notes.

[3]

Baraff, D., Witkin, A., and Kass, M. 2003. Untangling cloth. Proc. of ACM SIGGRAPH, 862--870.

Digital Library

[4]

Bridson, R., Fedkiw, R., and Anderson, J. 2002. Robust treament for collisions, contact and friction for cloth animation. Proc. of ACM SIGGRAPH, 594--603.

Digital Library

[5]

Cohen, J., Lin, M., Manocha, D., and Ponamgi, M. 1995. I-COLLIDE: An interactive and exact collision detection system for large-scale environments. In Proc. of ACM Interactive 3D Graphics Conference, 189--196.

Digital Library

[6]

Dobkin, D., Hershberger, J., Kirkpatrick, D., and Suri, S. 1993. Computing the intersection-depth of polyhedra. Algorithmica 9, 518--533.

[7]

Ehmann, S., and Lin, M. C. 2001. Accurate and fast proximity queries between polyhedra using convex surface decomposition. Computer Graphics Forum (Proc. of Eurographics'2001) 20, 3, 500--510.

[8]

Ericson, C. 2004. Real-Time Collision Detection. Morgan Kaufmann.

Digital Library

[9]

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

[10]

Fisher, S., and Lin, M. C. 2001. Deformed distance fields for simulation of non-penetrating flexible bodies. Proc. of EG Workshop on Computer Animation and Simulation, 99--111.

Digital Library

[11]

Govindaraju, N., Redon, S., Lin, M., and Manocha, D. 2003. CULLIDE: Interactive collision detection between complex models in large environments using graphics hardware. Proc. of ACM SIGGRAPH/Eurographics Workshop on Graphics Hardware, 25--32.

Digital Library

[12]

Govindaraju, N., Knott, D., Jain, N., Kabal, I., Tamstorf, R., Gayle, R., Lin, M., and Manocha, D. 2005. Collision detection between deformable models using chromatic decomposition. ACM Trans. on Graphics (Proc. of ACM SIGGRAPH) 24, 3, 991--999.

Digital Library

[13]

Heidelberger, B., Teschner, M., Keisner, R., Mueller, M., and Gross, M. 2004. Consistent penetration depth estimation for deformable collision response. Proc. of Vision, Modeling and Visualization, 315--322.

[14]

Hoff, K., Zaferakis, A., Lin, M., and Manocha, D. 2002. Fast 3d geometric proximity queries between rigid and deformable models using graphics hardware acceleration. Tech. Rep. TR02-004, Department of Computer Science, University of North Carolina.

[15]

James, D. L., and Pai, D. K. 2004. BD-Tree: Output-sensitive collision detection for reduced deformable models. Proc. of ACM SIGGRAPH, 393--398.

Digital Library

[16]

Johnson, D. E., and Cohen, E. 2004. Unified distance queries in a heterogeneous model environment. In ASME DETC.

[17]

Kawachi, K., and Suzuki, H. 2000. Distance computation between non-convex polyhedra at short range based on discrete Voronoi diagrams. IEEE Geometric Modeling and Processing, 123--128.

Digital Library

[18]

Kim, Y. J., Otaduy, M. A., Lin, M. C., and Manocha, D. 2002. Fast penetration depth computation for physically-based animation. In Proc. of ACM/Eurographics Symposium on Computer Animation, 23--31.

Digital Library

[19]

Knott, D., and Pai, D. K. 2003. CInDeR: Collision and interference detection in real-time using graphics hardware. Proc. of Graphics Interface, 73--80.

[20]

Larsen, E., Gottschalk, S., Lin, M., and Manocha, D. 2000. Distance queries with rectangular swept sphere volumes. Proc. of IEEE Int. Conference on Robotics and Automation, 3719--3726.

[21]

Larsson, T., and Akenine-Möller, T. 2001. Collision detection for continuously deforming bodies. In Eurographics, 325--333.

[22]

Lin, M., and Canny, J. F. 1991. Efficient algorithms for incremental distance computation. In IEEE Conference on Robotics and Automation, 1008--1014.

[23]

Lin, M. C., and Manocha, D. 2004. Collision and proximity queries. In Handbook of Discrete and Computational Geometry, 2nd Ed., J. E. Goodman and J. O'Rourke, Eds. CRC Press LLC, Boca Raton, FL, ch. 35, 787--807.

[24]

Mirtich, B. 1998. V-Clip: Fast and robust polyhedral collision detection. ACM Transactions on Graphics 17, 3 (July), 177--208.

Digital Library

[25]

Mueller, M., Heidelberger, B., Teschner, M., and Gross, M. 2005. Meshless deformation based on shape matching. Proc. of ACM SIGGRAPH, 471--478.

Digital Library

[26]

Okabe, A., Boots, B., and Sugihara, K. 1992. Spatial Tessellations: Concepts and Applications of Voronoi Diagrams. John Wiley & Sons, Chichester, UK.

Digital Library

[27]

Quinlan, S. 1994. Efficient distance computation between non-convex objects. In Proceedings of International Conference on Robotics and Automation, 3324--3329.

[28]

Redon, S., and Lin, M. 2006. A fast method for local penetration depth computation. Journal of Graphics Tools, To Appear.

[29]

Redon, S., Kim, Y. J., Lin, M. C., and Manocha, D. 2004. Fast continuous collision detection for articulated models. In Proceedings of ACM Symposium on Solid Modeling and Applications.

Digital Library

[30]

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

Digital Library

[31]

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.

[32]

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

Digital Library

[33]

Sud, A., Govindaraju, N., Gayle, R., and Manocha, D. 2006. Surface distance maps. Tech. Rep. TR06-011, Dept of Computer Science, University of North Carolina.

[34]

Sundaraj, K., and Laugier, C. 2000. Fast contact localization of moving deformable polyhedra. In Proc. of IEEE Int. Conference on Control, Automation, Robotics and Vision.

[35]

Teschner, M., Heidelberger, B., Muller, M., Pomeranets, D., and Gross, M. 2003. Optimized spatial hashing for collision detection of deformable objects. Proc. of Vision, Modeling and Visualization, 47--54.

[36]

Teschner, M., Kimmerle, S., Heidelberger, B., Zachmann, G., Raghupathi, L., Fuhrmann, A., Cani, M.-P., Faure, F., Magnenat-Thalmann, N., Strasser, W., and Volino, P. 2005. Collision detection for deformable objects. Computer Graphics Forum 19, 1, 61--81.

[37]

van den Bergen, G. 1997. Efficient collision detection of complex deformable models using AABB trees. Journal of Graphics Tools 2, 4, 1--14.

Digital Library

[38]

Volino, P., and Thalmann, N. M. 2000. Accurate collision response on polygon meshes. In Proc. of Computer Animation, 154.

Digital Library

Cited By

Chen XKonobrytskyi DTucker TKurfess TVuduc R(2019)Faster parallel collision detection at high resolution for CNC milling applicationsProceedings of the 48th International Conference on Parallel Processing10.1145/3337821.3337838(1-10)Online publication date: 5-Aug-2019
https://dl.acm.org/doi/10.1145/3337821.3337838
Tang Mwang tLiu ZTong RManocha D(2018)I-clothACM Transactions on Graphics10.1145/3272127.327500537:6(1-10)Online publication date: 4-Dec-2018
https://dl.acm.org/doi/10.1145/3272127.3275005
Erleben K(2018)Methodology for Assessing Mesh-Based Contact Point MethodsACM Transactions on Graphics10.1145/309623937:3(1-30)Online publication date: 27-Jul-2018
https://dl.acm.org/doi/10.1145/3096239
Show More Cited By

Index Terms

Fast proximity computation among deformable models using discrete Voronoi diagrams
1. Computing methodologies
  1. Artificial intelligence
    1. Computer vision
      1. Image and video acquisition
        3D imaging
  2. Computer graphics
    1. Animation
    2. Shape modeling
2. Theory of computation
  1. Randomness, geometry and discrete structures
    1. Computational geometry

Recommendations

Fast proximity computation among deformable models using discrete Voronoi diagrams
SIGGRAPH '06: ACM SIGGRAPH 2006 Papers

We present novel algorithms to perform collision and distance queries among multiple deformable models in dynamic environments. These include inter-object queries between different objects as well as intra-object queries. We describe a unified approach ...
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 ...
Distance Computation between Non-Convex Polyhedra at Short Range Based on Discrete Voronoi Regions
GMP '00: Proceedings of the Geometric Modeling and Processing 2000

An algorithm for calculating the minimum distance between non-convex polyhedra is described. A polyhedron is represented by a set of triangles. In calculating the distance between two polyhedra, it is important to search efficiently the pair of the ...

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Graphics

ACM Transactions on Graphics Volume 25, Issue 3

July 2006

742 pages

ISSN:0730-0301

EISSN:1557-7368

DOI:10.1145/1141911

Issue’s Table of Contents

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]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 July 2006

Published in TOG Volume 25, Issue 3

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

50
Total Citations
View Citations
1,322
Total Downloads

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

Reflects downloads up to 13 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Chen XKonobrytskyi DTucker TKurfess TVuduc R(2019)Faster parallel collision detection at high resolution for CNC milling applicationsProceedings of the 48th International Conference on Parallel Processing10.1145/3337821.3337838(1-10)Online publication date: 5-Aug-2019
https://dl.acm.org/doi/10.1145/3337821.3337838
Tang Mwang tLiu ZTong RManocha D(2018)I-clothACM Transactions on Graphics10.1145/3272127.327500537:6(1-10)Online publication date: 4-Dec-2018
https://dl.acm.org/doi/10.1145/3272127.3275005
Erleben K(2018)Methodology for Assessing Mesh-Based Contact Point MethodsACM Transactions on Graphics10.1145/309623937:3(1-30)Online publication date: 27-Jul-2018
https://dl.acm.org/doi/10.1145/3096239
Li CDing JHong ZPan YLiu P(2018)A Surface Mass-Spring Model With New Flexion Springs and Collision Detection Algorithms Based on Volume Structure for Real-Time Soft-Tissue Deformation InteractionIEEE Access10.1109/ACCESS.2018.28836796(75572-75597)Online publication date: 2018
https://doi.org/10.1109/ACCESS.2018.2883679
Wang TLiu ZTang MTong RManocha D(2017)Efficient and Reliable Self‐Collision Culling Using Unprojected Normal ConesComputer Graphics Forum10.1111/cgf.1309536:8(487-498)Online publication date: 20-Mar-2017
https://doi.org/10.1111/cgf.13095
Li SZhang TWang GSun HManocha D(2017)Multi-contact frictional rigid dynamics using impulse decomposition2017 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)10.1109/IROS.2017.8206547(6420-6427)Online publication date: 24-Sep-2017
https://dl.acm.org/doi/10.1109/IROS.2017.8206547
Park JPark CManocha D(2017)Efficient probabilistic collision detection for non-convex shapes2017 IEEE International Conference on Robotics and Automation (ICRA)10.1109/ICRA.2017.7989226(1944-1951)Online publication date: 29-May-2017
https://dl.acm.org/doi/10.1109/ICRA.2017.7989226
Edwards JDaniel EPascucci VBajaj C(2015)Approximating the Generalized Voronoi Diagram of Closely Spaced ObjectsComputer Graphics Forum10.1111/cgf.1256134:2(299-309)Online publication date: 1-May-2015
https://dl.acm.org/doi/10.1111/cgf.12561
Lee YKim Y(2015)PhongPD: Gradient-continuous penetration metric for polygonal models using Phong projection2015 IEEE International Conference on Robotics and Automation (ICRA)10.1109/ICRA.2015.7138980(57-62)Online publication date: May-2015
https://doi.org/10.1109/ICRA.2015.7138980
Hegedűs G(2015)Newton’s method based collision avoidance in a CAD environment on ball nut grindingThe International Journal of Advanced Manufacturing Technology10.1007/s00170-015-7796-5Online publication date: 12-Sep-2015
https://doi.org/10.1007/s00170-015-7796-5
Show More Cited By

View Options

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 Article

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Issue’s Table of Contents