ACM Home Page
Please provide us with feedback. Feedback
OBBTree: a hierarchical structure for rapid interference detection
Full text PdfPdf (341 KB)
Source International Conference on Computer Graphics and Interactive Techniques archive
Proceedings of the 23rd annual conference on Computer graphics and interactive techniques table of contents
Pages: 171 - 180  
Year of Publication: 1996
ISBN:0-89791-746-4
Authors
S. Gottschalk  Department of Computer Science, University of North Carolina, Chapel Hill, NC
M. C. Lin  Department of Computer Science, University of North Carolina, Chapel Hill, NC and U.S. Army Research Office
D. Manocha  Department of Computer Science, University of North Carolina, Chapel Hill, NC
Sponsor
SIGGRAPH: ACM Special Interest Group on Computer Graphics and Interactive Techniques
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 36,   Downloads (12 Months): 302,   Citation Count: 203
Additional Information:

references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/237170.237244
What is a DOI?

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.

 
1
 
2
3
 
4
B. Barber, D. Dobkin, and H. Huhdanpaa. The quickhull algorithm for convex hull. Technical Report GCG53, The Geometry Center, MN, 1993.
5
 
6
S. Cameron. Collision detection by four-dimensional intersection testing. P~vceedings of International Conference on Robotics and Automation, pages 291- 302, 1990.
7
 
8
9
10
 
11
R.O. Duda and RE. Hart. Pattern Classification and Scene Analysis. John Wiley and Sons, 1973.
12
13
 
14
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.
 
15
S. Gottschalk. Separating axis theorem. Technical Report TR96-024, Department of Computer Science, UNC Chapel Hill, 1996.
 
16
17
 
18
M. Held, J.T. Klosowski, and J.S.B. Mitchell. Evaluation of collision detection methods for virtual reality fly-throughs. In Canadian Conference on Computational Geometry, 1995.
19
 
20
R M. Hubbard. Interactive collision detection. In P1vceedings oflEEE Symposium on Resealvh Frontiers in Virtual Reality, October 1993.
 
21
 
22
M.C. Lin and Dinesh Manocha. Fast interference detection between geometric models. The Visual Computer, 11(10):542-561,1995.
23
24
 
25
J. O'Rourke. Finding minimal enclosing boxes. Internat. J. Comput. Info~. Sci., 14:183-199,1985.
26
 
27
 
28
S. Quinlan. Efficient distance computation between non-convex objects. In P1vceedings of International Conference on Robotics and Automation, pages 3324-3329,1994.
 
29
A. Rappoport. The extended convex differences tree (ecdt) representation for n-dimensional polyhedra. International Journal of Computational Geometry and Applications, 1 (3):227-41,1991.
30
 
31
H. Samet. SpatiaI Data Structures: Quadtree, Octrees and Other Hieralvhical Methods. Addison Wesley, 1989.
 
32
33
 
34
W.Bouma and G.Vanecek. Collision detection and analysis in a physically based simulation. P1vceedings Eulvgraphics workshop on animation and simulation, pages 191-203,1991.
35
 
36
E. Welzl. Smallest enclosing disks (balls and ellipsoids). Technical Report B 91-09, Fachbereich Mathematik, Freie Universitat, Berlin, 1991.

CITED BY  203

Collaborative Colleagues:
S. Gottschalk: colleagues
M. C. Lin: colleagues
D. Manocha: colleagues