| H-Walk: hierarchical distance computation for moving convex bodies |
| Full text |
Pdf
(1.08 MB)
|
| Source
|
Annual Symposium on Computational Geometry
archive
Proceedings of the fifteenth annual symposium on Computational geometry
table of contents
Miami Beach, Florida, United States
Pages: 265 - 273
Year of Publication: 1999
ISBN:1-58113-068-6
|
|
Authors
|
|
Leonidas J. Guibas
|
Computer Science Department, Stanford University, Stanford, CA
|
|
David Hsu
|
Computer Science Department, Stanford University, Stanford, CA
|
|
Li Zhang
|
Computer Science Department, Stanford University, Stanford, CA
|
|
| Sponsors |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 7, Downloads (12 Months): 25, Citation Count: 11
|
|
|
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
Cam97
|
S. Cameron. Enhancing GJK: computing minimum and penetration distances between convex polyhedra. In Proc. IEEE Int. Conf. on Robotics and Automation, 1997.
|
 |
CLMP95
|
Jonathan D. Cohen , Ming C. Lin , Dinesh Manocha , Madhav Ponamgi, I-COLLIDE: an interactive and exact collision detection system for large-scale environments, Proceedings of the 1995 symposium on Interactive 3D graphics, p.189-ff., April 09-12, 1995, Monterey, California, United States
[doi> 10.1145/199404.199437]
|
| |
DK85
|
D.P. Dobkin and D. G. Kirkpatrick. A linear algorithm for determining the separation of convex polyhedra. J. Algorithms, 6:381-392, 1985.
|
| |
DK90
|
|
| |
Ede85
|
|
| |
EGSZ99
|
Jeff Erickson , Leonidas J. Guibas , Jorge Stolfi , Li Zhang, Separation-sensitive collision detection for convex objects, Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms, p.327-336, January 17-19, 1999, Baltimore, Maryland, United States
|
| |
GJK88
|
E.G. Gilbert, D. W. Johnson, and S. S. Keerthi. A fast procedure for computing the distance between complex objects. IEEE Journal of Robotics and Automation, 4(2), 1988.
|
 |
GLM96
|
|
 |
GMPR77
|
Leo J. Guibas , Edward M. McCreight , Michael F. Plass , Janet R. Roberts, A new representation for linear lists, Proceedings of the ninth annual ACM symposium on Theory of computing, p.49-60, May 04-04, 1977, Boulder, Colorado, United States
[doi> 10.1145/800105.803395]
|
| |
Hub95
|
|
| |
LC91
|
M.C. Lin and J. F. Canny. A fast algorithm for incremental distance calculation. In Proc. IEEE Int. Conf. on Robotics and Automation, volume 2, pages 1008-1014, 1991.
|
| |
Mir97
|
B. Mirtich. V-Clip: fast and robust polyhedral collision detection. Technical Report TR-97- 05, Mitsubishi Electrical Research Laboratory, 1997.
|
| |
Qui94
|
Sean Quinlan. Efficient distance computation between non-convex objects. In Proc. IEEE Int. Conf. on Robotics and Automation, pages 3324- 3329, 1994.
|
CITED BY 11
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Mashhuda Glencross , Alan G. Chalmers , Ming C. Lin , Miguel A. Otaduy , Diego Gutierrez, Exploiting perception in high-fidelity virtual environmentsAdditional presentations from the 24th course are available on the citation page, ACM SIGGRAPH 2006 Courses, July 30-August 03, 2006, Boston, Massachusetts
|
|
|
|
|
|
|
|
|
|
|
|
Arthur Gregory , Ajith Mascarenhas , Stephen Ehmann , Ming Lin , Dinesh Manocha, Six degree-of-freedom haptic display of polygonal models, Proceedings of the conference on Visualization '00, p.139-146, October 2000, Salt Lake City, Utah, United States
|
|
|
|
|