Computing distances between surfaces using line geometry

Proceedings - Pacific Conference on Computer Graphics and Applications

Volumn 2002-January, Issue , 2002, Pages 236-245

  Sohn, Kyung Ah ^a   Jüttler, Bert ^b   Kim, Myung Soo ^a   Wang, Wenping ^c  

^a Seoul National University   (South Korea)

^b JOHANNES KEPLER UNIVERSITY LINZ   (Austria)

^c UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Application software; Biology computing; Chromium; Computational geometry; Computer science; Ellipsoids; Engine cylinders; Equations; Irrigation; Testing

Indexed keywords

APPLICATION PROGRAMS; CHROMIUM; COMPUTATIONAL GEOMETRY; COMPUTER GRAPHICS; COMPUTER SCIENCE; ENGINE CYLINDERS; GEOMETRY; IRRIGATION; SOFTWARE TESTING; TESTING;

BIOLOGY COMPUTING; COMPUTING DISTANCES; DISTANCE COMPUTATION; ELLIPSOIDS; EQUATIONS; FREE-FORM SURFACE; SURFACE-SURFACE INTERSECTIONS; SYSTEM OF EQUATIONS;

ALGORITHMS;

EID: 0344908944     PISSN: 15504085     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/PCCGA.2002.1167866     Document Type: Conference Paper

References (34)

1. D. Baraff. Curved surfaces and coherence for nonpenetrating rigid body simulation. Computer Graphics (Proc. of ACM SIGGRAPH'90), 24(4):19-28, 1990.
2. S. Bischoff and L. Kobbelt. Ellipsoid decomposition of 3Dmodels. Proc. of the First Symp. of 3D Data Processing, Visualization and Transmission, IEEE Press, pp. 480-488, 2002.
3. O. Bottema and B. Roth. Theoretical Kinematics. Dover, New York 1990.
4. S. Cameron. A comparison of two fast algorithm for computing the distance between convex polyhedra. IEEE Trans. on Robotics and Automation, 13(6):915-920, 1997.
5. K. Chung and W. Wang. Quick collision detection of polytopes in virtual environments. Prof. of VRST'96, pp. 125-131, 1996.
6. R. Dietz, J. Hoschek, and B. Jüttler. An algebraic approach to curves and surfaces on the sphere and on other quadric. Comp. Aided Geom. Design, 10:211-229, 1993.
7. D. H. Eberly. 3D Game Engine Design. Morgan Kaufmann, San Francisco, 2001.
8. J. Foley, A. van Dam, S. Feiner, and J. Hughes. Computer Graphics: Principles and Practice, 2nd Ed. Addision-Wesley, Reading, 1990.
9. J. Hoschek. Liniengeometrie, BI Hochschulskripten 733a/b, Bibliographisches Institut Zürich, 1971.
10. J. Hoschek and D. Lasser. Fundamentals of Computer Aided Geometric Design. AK Peters, Wellesley, 1993.
11. V. Hlavatý. Differential Line Geometry. Noordhoff, Groningen 1953.
12. E. Gilbert, D. Johnson, and S. Keerthi. A fast procedure for computing the distance between objects in three-dimensional space. IEEE J. of Robotics and Automation, 6:193-203, 1988.
13. E. Gilbert and C. Foo. Computing the distance between general convex objects in three-dimensional space. IEEE Trans. on Robotics and Automation, 6(1):53-61, 1990.
14. S. Gottschalk, M. Lin and D. Manocha. OBB-Tree: A hierarchical structure for rapid interference detection, Proc. of ACM SIGGRAPH'96, pp. 171-180, 1996.
15. P. Jiménez, F. Thomas, and C. Torras. 3D collision detection: A survey. Computers & Graphics, 25:269-285, 2001.
16. D. Johnson and E. Cohen. A framework for efficient minimum distance computations. Proc. of IEEE Conf. on Robotics and Automation, pp. 3678-368, 1998.
17. B. Jüttler. Visualization of moving objects using dual quaternion curves. Computers & Graphics, 18(3):315-326, 1994.
18. B. Jüttler and M. L. Sampoli. Hermite interpolation by piecewise polynomial surfaces with rational offsets, Comp. Aided Geom. Design 17:361-385, 2000.
19. K. Kawachi and H. Suzuki. Distance computation between non-convex polyhedra at short range based on discrete Voronoi regions. Proc. of Geometric Modeling and Processing, pp. 123-128, Hong Kong, April 10-12, 2000.
20. K.-J. Kim. Minimum distance between a canal surface and a simple surface. To appear in Computer-Aided Design, 2002.
21. J. T. Klosowski, M. Held, J. S. B. Mitchell, H. Sowizral, and K. Zikan. Efficient collision detection using bounding volume hierarchies of k-DOPs. IEEE Trans. on Visualization and Computer Graphics, 4(1):21-36, 1998.
22. E. Larsen, S. Gottschalk, M. Lin, and D. Manocha. Fast proximity queries with swept sphere volumes. Proc. of IEEE Conf. on Robotics and Automation, 2000.
23. C. Lennerz and E. Schömer. Efficient distance computation for quadratic curves and surfaces. Proc. of Geometric Modeling and Processing, pp. 60-69, Saitama, Japan, July 10-12, 2002.
24. M. C. Lin and S. Gottschalk. Collision detection between geometric models: A survey. Mathematics of Surfaces VIII, R. Cripps, editor, Information Geometers, pp. 37-56, 1998.
25. M. C. Lin and J. F. Canny. A fast algorithm for incremental distance calculation. Proc. of IEEE Int'l Conference on Robotics and Automation, pp. 1008-1014, 1991.
26. N. Patrikalakis. Surface-to-surface intersections. IEEE Computer Graphics and Applications, 13(1):89-95, 1993.
27. N. Patrikalakis and T. Maekawa. Shape Interrogation for Computer Aided Design and Manufacturing, Springer-Verlag, Heidelberg, 2002.
28. E. Rimon and S. Boyd. Obstacle collision detection using best ellipsoid fit. Journal of Intelligent and Robotics Systems, 18:105-126, 1997.
29. H. Pottmann and J. Wallner. Computational Line Geometry. Springer, Heidelberg, 2001.
30. J.-K. Seong, M.-S. Kim, and K. Sugihara. The Minkowski sum of two simple surfaces generated by slope-monotone closed curves. Proc. of Geometric Modeling and Processing, pp. 33-42, Saitama, Japan, July 10-12, 2002.
31. J. Snyder, A. Woodbury, K. Fleischer, B. Currin, and A. Barr. Interval methods for multi-point collisions between timedependent curved surfaces. Proc. of ACM SIGGRAPH'93, pp. 321-334, 1996.
32. O. Staude, Flächen zweiter Ordnung und ihre Systeme und Durchdringungskurven, Encykl. d. math. Wiss. 32 (1904), pp. 161-256.
33. S. Quinlan. Efficient distance computation between nonconvex objects. Proc. of IEEE Conf. on Robotics and Automation, pp. 3324-3329, 1994.
34. W. Wang, J. Wang, and M.-S. Kim. An algebraic condition for the separation of two ellipsoids. Comp. Aided Geom. Design, 18(6):531-539, 2001.