Rapid and Accurate Contact Determination between Spline Models using ShellTrees

Computer Graphics Forum

Volumn 17, Issue 3, 1998, Pages 315-326

  Krishnan, S ^a   Gopi, M ^a   Lin, M ^a   Manocha, D ^a   Pattekar, A ^a  

^a Brooks Computer Science Building   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0346906795     PISSN: 01677055     EISSN: None     Source Type: Journal    
DOI: 10.1111/1467-8659.00278     Document Type: Article

References (38)

1. C.L. Bajaj, C.M. Hoffmann, J.E.H. Hopcroft, and R.E. Lynch. Tracing surface intersections. Computer Aided Geometric Design, 5:285-307, 1988.
2. D. Baraff. Curved surfaces and coherence for nonpenetrating rigid body simulation. ACM Computer Graphics, 24(4):19-28, 1990.
3. G. Barequet, B. Chazelle, L. Guibas, J. Mitchell, and A. Tal. Boxtree: A hierarchical representation of surfaces in 3d. In Proc. of Eurographics'96, 1996.
4. N. Beckmann, H. Kriegel, R. Schneider, and B. Seeger. The r*-tree: An efficient and robust access method for points and rectangles. Proc. SIGMOD Conf. on Management of Data, pages 322-331, 1990.
5. S. Cameron. Approximation hierarchies and s-bounds. In Proceedings. Symposium on Solid Modeling Foundations and CAD/CAM Applications, pages 129-137, Austin, TX, 1991.
6. S. Cameron. Enhancing gjk: Computing minimum and penetration distance between convex polyhedra. Proceedings of International Conference on Robotics and Automation, 1997.
7. J. Cohen, M. Lin, D. Manocha, and M. Ponamgi. I-collide: An interactive and exact collision detection system for large-scale environments. In Proc. of ACM Interactive 3D Graphics Conference, pages 189-196, 1995.
8. Tom Duff. Interval arithmetic and recursive subdivision for implicit functions and constructive solid geometry. ACM Computer Graphics, 26(2):131-139, 1992.
9. H. Edelsbrunner. A new approach to rectangle intersections, part i. Int. J. of Comput. Math, 13:209-219, 1983.
10. E. G. Gilbert, D. W. Johnson, and S. S. Keerthi. A fast procedure for computing the distance between objects in three-dimensional space. IEEE J. Robotics and Automation, vol RA-4:193-203, 1988.
11. S. Gottschalk, M. Lin, and D. Manocha. Obb-tree: A hierarchical structure for rapid interference detection. In Proc. of ACM Siggraph'96, pages 171-180, 1996.
12. B. V. Herzen, A. H. Barr, and H. R. Zatz. Geometric collisions for time-dependent parametric surfaces. Computer Graphics, 24(4):39-48, 1990.
13. M.E. Hohmeyer. A surface intersection algorithm based on loop detection. International Journal of Computational Geometry and Applications, 1(4):473-490, 1991. Special issue on Solid Modeling.
14. J.E. Hopcroft, J.T. Schwartz, and M. Sharir. Efficient detection of intersections among spheres. The International Journal of Robotics Research, 2(4):77-80, 1983.
15. P. M. Hubbard. Interactive collision detection. In Proceedings of IEEE Symposium on Research Frontiers in Virtual Reality, October 1993.
16. J. Klosowski, M. Held, J.S.B. Mitchell, H. Sowizral, and K. Zikan. Efficient collision detection using bounding volume hierarchies of k-dops. In Siggraph'96 Visual Proceedings, page 151, 1996.
17. P.A. Koparkar and S. P. Mudur. A new class of algorithms for the processing of parametric curves. Computer-Aided Design, 15(1):41-45, 1983.
18. S. Krishnan and D. Manocha. An efficient surface intersection algorithm based on the lower dimensional formulation. ACM Transactions on Graphics, 16(1):74-106, 1997.
19. S. Krishnan, A. Pattekar, M. Lin, and D. Manocha. Spherical shell: A higher order bounding volume for fast proximity queries. In Proc. of Third International Workshop on Algorithmic Foundations of Robotics, 1998.
20. J.M. Lane and R.F. Riesenfeld. A theoretical development for the computer generation and display of piecewise polynomial surfaces. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2(1):150-159, 1980.
21. M.C. Lin and John F. Canny. Efficient algorithms for incremental distance computation. In IEEE Conference on Robotics and Automation, pages 1008-1014, 1991.
22. M.C. Lin and Dinesh Manocha. Fast interference detection between geometric models. The Visual Computer, 11(10):542-561, 1995.
23. D. Manocha and J.F. Canny. A new approach for surface intersection. International Journal of Computational Geometry and Applications, 1(4):491-516, 1991. Special issue on Solid Modeling.
24. D. Manocha and J. Demmel. Algorithms for intersecting parametric and algebraic curves I: simple intersections. ACM Transactions on Graphics, 13(1):73-100, 1994.
25. D. Manocha and S. Krishnan. Algebraic pruning: A fast technique for curve and surface intersections. Computer Aided Geometric Design, 20:1-23, 1997.
26. B. Naylor, J. Amanatides, and W. Thibault. Merging bsp trees yield polyhedral modeling results. In Proc. of ACM Siggraph, pages 115-124, 1990.
27. M. Ponamgi, D. Manocha, and M. Lin. Incremental algorithms for collision detection between general solid models. In Proc. of ACM/Siggraph Symposium on Solid Modeling, pages 293-304, 1995.
28. S. Quinlan. Efficient distance computation between non-convex objects. In Proceedings of International Conference on Robotics and Automation, pages 3324-3329, 1994.
29. J.R. Rossignac and A.A.G. Requicha. Piecewise-circular curves for geometric modeling. IBM Journal of Research and Development, 31(3):296-313, 1987.
30. T.W. Sederberg and R.J. Meyers. Loop detection in surface patch intersections. Computer Aided Geometric Design, 5:161-171, 1988.
31. T.W. Sederberg and T. Nishita. Curve intersection using bézier clipping. Camputer-Aided Design, 22:538-549, 1990.
32. T.W. Sederberg and T. Nishita. Geometric hermite approximation of surface patch intersection curves. Computer Aided Geometric Design, 8:97-114, 1991.
33. T.W. Sederberg and S.R. Parry. Comparison of three curve intersection algorithms. Computer-Aided Design, 18(1):58-63, 1986.
34. T.W. Sederberg, S. White, and A. Zundel. Fat arcs: A bounding region with cubic convergence. Computer Aided Geometric Design, 6:205-218, 1989.
35. R. Seidel. Linear programming and convex hulls made easy. In Proc. 6th Ann. ACM Conf. on Computational Geometry, pages 211-215, Berkeley, California, 1990.
36. J. Snyder. Interval arithmetic for computer graphics. In Proceedings of ACM Siggraph, pages 121-130, 1992.
37. J. Snyder and et. al. Interval methods for multi-point collisions between time dependent curved surfaces. In Proceedings of ACM Siggraph, pages 321-334, 1993.
38. J. Stoer and R. Bulirsch. Introduction to Numerical Analysis. Springer-Verlag, 1993.