V-Clip: Fast and Robust Polyhedral Collision Detection

V-Clip: Fast and Robust Polyhedral Collision Detection (1997)

Cached

Download Links

[www.cs.ubc.ca]
[www.merl.com]

Other Repositories/Bibliography

DBLP

by Brian Mirtich

Citations:

154 - 3 self

BibTeX

@MISC{Mirtich97v-clip:fast,
    author = {Brian Mirtich},
    title = {V-Clip: Fast and Robust Polyhedral Collision Detection},
    year = {1997}
}

Bookmark

OpenURL

Abstract

Citations

842	Linear and nonlinear programming - Luenberger - 1984
596	OBBTree: A Hierarchical Structure for Rapid Interference Detection - Gottschalk, Lin, et al. - 1996
246	A Fast Procedure for Computing the Distance Between Complex Objects in Three-Dimensional Space - Gilbert, Johnson, et al. - 1988
244	Simulation of simplicity: A technique to cope with degenerate cases in geometric algorithms - Edelsbrunner, Mücke - 1990
241	I-collide: an interactive and exact collision detection system for large-scale environments - Cohen, Lin, et al. - 1995
130	Curved Surfaces and Coherence for Non-penetrating Rigid Body Simulation - Baraff - 1990
110	Impulse-Based Dynamic Simulation of Rigid Body Systems - Mirtich - 1996
109	Enhancing GJK: Computing Minimum Penetration Distances between Convex Polyhedra - Cameron - 1997
99	E cient collision detection for animation and robotics - Lin - 1993
56	V-Collide: Accelerated Collision Detection for VRML." 2 nd Annual Symposium on the Virtual Reality Modeling Language - Hudson, Lin, et al. - 1997
22	Object representation by means of nonminimal division quadtrees and octrees - Ayala, Brunet, et al. - 1985
9	Fast collision detection of moving convex polyhedra - Rabbitz - 1994
3	Interactive solid modeling via partitioning trees - Naylor - 1992
1	Quick collision detection library. www.cs.hku.hk/~tlchung/collision library.html - Chung - 1997
1	A Proofs Theorem 1 Let X and Y be a pair of features from disjoint convex polyhedra, and let x 2 X and y 2 Y be the closest points between X and Y . If x 2 VR(Y ) and y 2 VR(X), then x and y are a globally closest pair of points between the polyhedra. Den - Company, York, et al. - 1988