ACM Home Page
Please provide us with feedback. Feedback
Incremental algorithms for collision detection between solid models
Full text PdfPdf (1.24 MB)
Source ACM Symposium on Solid and Physical Modeling archive
Proceedings of the third ACM symposium on Solid modeling and applications table of contents
Salt Lake City, Utah, United States
Pages: 293 - 304  
Year of Publication: 1995
ISBN:0-89791-672-7
Authors
Madhav Ponamgi  Department of Computer Science, University of North Carolina, Chapel Hill, NC
Dinesh Manocha  Department of Computer Science, University of North Carolina, Chapel Hill, NC
Ming C. Lin  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): 8,   Downloads (12 Months): 67,   Citation Count: 20
Additional Information:

references   cited by   index terms   collaborative colleagues   peer to peer  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/218013.218076
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.

 
AANJ94
 
AP76
A.Appel and P.Will. Determining the three-dimensional convex hull of a polyhedron. IBM Journal of Research and Development, pages 590-600, 1976.
Bor90
 
Bar92
 
BT92
Cam91
 
Can86
 
CC86
S. Cameron and R. K. Culley. Determining the minimum translational distance between two convex polyhedra. Proceedings of International Conference on Robotics and Automation, pages pp. 591-596, 1986.
CD87
 
Cha84
 
Cha89
B. Chazelle. An optimal algorithm for intersecting threedimensional convex polyhedra. In Proc. 80th Anna. IEEE Sympos. Found. Comput. Sci., pages 586-591, 1989.
CLMP95
 
DF78
D.Muller and F.Preparata. Finding the intersection of two convex polyhedra. Theoretical Computer Science, 8(2):217-236, 1978.
 
DK85
D.P. Dobkin and D. G. Kirkpatrick. A linear algorithm for determining the separation of convex pol yhedra. J. Algorithms, 6:381-392, 1985.
Duf92
 
DZ93
P. Dworkin and D. Zeltzer. A new model for efficient dynamics simulation. Proceedings gurographics workshop on animation and simulation, pages 175-184, 1993.
ea93
FKN80
HBZ90
 
HH87
C.M. Hoffmann and J. E. Hopcroft. Simulation of physical systems from geometric models. IEEE Journal on Robotics and Automation, 3(3):194-206, 1987.
 
Hop88
J.E. Hopcroft. Electronic prototyping. IEEE Transactions on Aerospace and Electronic Systems, 24(2):663- 667, 1988.
 
Hub93
P.M. Hubbard. Interactive collision detection. In Proceedings o.f IEEE Symposium on Research Frontiers in Virtual Reality, October 1993.
 
LC91
M.C. Lin and John F. Canny. Efficient algorithms for incremental distance computation. In IEEE Con}erence on Robotics and Automation, 1991.
 
Lin93
 
LM95
M.C. Lin and Dinesh Manocha. Efficient contact determination between geometric models. International Journal of Computational Geometry and Applications, 1995. To appear.
 
Lou66
P. Loutrel. Determination of hidden edges in polyhedral figures. Technical Report NYU-3-12-1966, Department of Computer Science, New York University, 1966.
MW88
NAT90
 
Nay92
 
O’R94
 
PML94
 
PS85
 
Tur89
G. Turk. Interactive collision detection for molecular graphics. Master's thesis, Computer Science Department, University of North Carolina at Chapel Hill, 1989.
 
WG91
W.Bouma and G.Vanecek. Collision detection and analysis in a physically based simulation. Proceedings Eurographics workshop on animation and simulation, pages 191-203, 1991.
WG93

CITED BY  20
 
 
 
 
 
 
 
 
 
 
 

Collaborative Colleagues:
Madhav Ponamgi: colleagues
Dinesh Manocha: colleagues
Ming C. Lin: colleagues

Peer to Peer - Readers of this Article have also read: