Skip to main content

Quick Elimination of Non-Interference Polytopes in Virtual Environments

  • Conference paper
Virtual Environments and Scientific Visualization ’96

Part of the book series: Eurographics ((EUROGRAPH))

Abstract

The problem of collision detection is fundamental to interactive applications such as computer animation and virtual environments. In these fields, prompt recognition of possible impacts is important for computing real-time response. However, existing algorithms do not eliminate non-interfence objects efficiently. This paper presents a practical algorithm to quickly eliminate most non-interference convex polyhedra when their bounding boxes overlap. The idea is to search for a proper separating plane between two polyhedra and cache this plane as a witness for the next time step. Temporal and geometric coherences are exploited in this algorithm so that it runs in expected constant time.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. D. J. Cohen, M.C. Lin, D. Manocha, M. Ponamgi. I-Collide: An interactive and exact collision detection system for large-scale environments. Proceeding of Symposium of Interactive 3D Graphics, pp. 189–196, 1995.

    Google Scholar 

  2. M. Moore and J. Wilhelms. Collision detection and response for computer animation, ACM Computer Graphics, Vol. 22, No. 4, pp. 289–298, 1988.

    Article  Google Scholar 

  3. W. Thibault and B. Naylor. Set operations on polyhedra using binary space partitioning trees, ACM Computer Graphics, 4, pp. 153–162, 1987.

    Article  MathSciNet  Google Scholar 

  4. A. Foisy., V. Hayward, and S. Aubry. The use of awareness in collision prediction, International Conference on Robotics and Automation, pp. 338–343. IEEE, 1990.

    Google Scholar 

  5. A. Smith, Yoshifumi Kitamu, Haruo Takemura and Fumio Kishino. A simple and efficient method for accurate collision detection among deformable polyhedral objects in arbitrary motion, Virtual Reality Annual International Symposium, pp. 136–145, IEEE, 1995.

    Google Scholar 

  6. A. Garcia-Alonso, N. Serrano and J. Flaquer. Solving the collision detection problem, IEEE Computer Graphics and Applications, 13(3), pp. 36–43, 1994.

    Article  Google Scholar 

  7. Y. Yang and N. Thalmann. An improved algorithm for collision detection in cloth animation with human body, First Pacific Conference on Computer Graphics and Application, pp. 237–251, 1993.

    Google Scholar 

  8. M. Lin and J. Canny. Efficient collision detection for animation, Proceedings of the Third Eurographics Workshop on Animation and Simulation, Cambridge, 1991.

    Google Scholar 

  9. W. Bouma and G. Vanecek. Collision detection and analysis in a physical based simulation, Eurographics Workshop on Animation and Simulation, pp. 191–203, September, 1991.

    Google Scholar 

  10. D. Baraff. Curved surfaces and coherence for non-penetrating rigid body simulation, ACM Computer Graphics, Vol. 24, No. 4, pp. 19–28, 1990.

    Article  Google Scholar 

  11. Rich Rabbitz. Fast collision detection of moving convex polyhedra, Graphics Gem IV, AP Professional, pp. 83–109, 1994.

    Google Scholar 

  12. D.P. Dobkin and D.G. Kirkpatrick. A linear algorithm for determining the separation of convex polyhedra. Journal of Algorithms, pp. 381–392, 1985.

    Google Scholar 

  13. 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.

    Google Scholar 

  14. Philip M. Hubbard. Collision Detection for Interactive Graphics Applications, IEEE Transactions on Visualization and Computer Graphics, Vol. 1, No. 3, pp. 218–228, 1995.

    Google Scholar 

  15. E. G. Gilbert, D. W. Johnson, and S. S. Keerthi. A fast procedure for computing the distance between complex object in three-dimensional space, IEEE Journal of Robotics and Automation, 4(2):193–203, 1988.

    Article  Google Scholar 

  16. Elmar Schomer and Christian Thiel. Efficient collision detection for moving polyhedra, Proceedings of the 11th Annual Symposium on Computational Geometry, pp. 51–60, 1995.

    Google Scholar 

  17. M. Ponamgi, D. Manocha and M. Lin, Incremental algorithms for collision detection between solid models, Proceedings of ACM/Siggraph symposium on Solid Modeling, pp. 293–304, 1995.

    Google Scholar 

  18. R. T. Rockafellar, Convex Analysis. Princeton University Press, 1970.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag/Wien

About this paper

Cite this paper

Chung, K., Wang, W. (1996). Quick Elimination of Non-Interference Polytopes in Virtual Environments. In: Göbel, M., David, J., Slavik, P., van Wijk, J.J. (eds) Virtual Environments and Scientific Visualization ’96. Eurographics. Springer, Vienna. https://doi.org/10.1007/978-3-7091-7488-3_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-7091-7488-3_7

  • Publisher Name: Springer, Vienna

  • Print ISBN: 978-3-211-82886-1

  • Online ISBN: 978-3-7091-7488-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics