-
1
-
-
0030381077
-
The quick-hull algorithm for convex hulls
-
B. Barber, D. Dobkin, and H. Huhdanpaa, The quick-hull algorithm for convex hulls. ACM Transactions on Mathematical Software, 22(4):469-483, 1996.
-
(1996)
ACM Transactions on Mathematical Software
, vol.22
, Issue.4
, pp. 469-483
-
-
Barber, B.1
Dobkin, D.2
Huhdanpaa, H.3
-
4
-
-
84949199987
-
Heuristic methods for randomized path planning in potential fields
-
Banff, Alberta, Canada
-
S. Caselli, M. Reggiani, and R. Rocchi. Heuristic methods for randomized path planning in potential fields. In IEEE Int. Symp. on Computational Intelligence in Robotics and Automation, Banff, Alberta, Canada, 2001.
-
(2001)
IEEE Int. Symp. on Computational Intelligence in Robotics and Automation
-
-
Caselli, S.1
Reggiani, M.2
Rocchi, R.3
-
5
-
-
0036057676
-
Parallel path planning with multiple evasion strategies
-
S. Caselli, M. Reggiani, and R. Sbravati. Parallel Path Planning with Multiple Evasion Strategies. In IEEE International Conference on Robotics and Automation, Washington, DC, May 2002.
-
IEEE International Conference on Robotics and Automation, Washington, DC, May 2002
-
-
Caselli, S.1
Reggiani, M.2
Sbravati, R.3
-
6
-
-
0029178789
-
I-collide: An interactive and exact collision detection system for large-scale environments
-
J. Cohen, M. Lin, D. Manocha, and M. Ponamgi. I-Collide: an interactive and exact collision detection system for large-scale environments. ACM Int. 3D Graphics Conference, 1, 1995.
-
(1995)
ACM Int. 3D Graphics Conference
, vol.1
-
-
Cohen, J.1
Lin, M.2
Manocha, D.3
Ponamgi, M.4
-
8
-
-
0011717680
-
Accurate and fast proximity queries between polyhedra using convex surface decomposition
-
Manchester, UK
-
S. Ehmann and M. Lin. Accurate and fast proximity queries between polyhedra using convex surface decomposition. In Eurographics 2001, Manchester, UK, 2001.
-
(2001)
Eurographics 2001
-
-
Ehmann, S.1
Lin, M.2
-
10
-
-
0023998710
-
A fast procedure for computing the distance between complex objects in three dimensional space
-
E. Gilbert, D. Johnson, and S. Keerthi. A fast procedure for computing the distance between complex objects in three dimensional space. IEEE Journal of Robotics and Automation, 4(2):193-203, 1988.
-
(1988)
IEEE Journal of Robotics and Automation
, vol.4
, Issue.2
, pp. 193-203
-
-
Gilbert, E.1
Johnson, D.2
Keerthi, S.3
-
11
-
-
0030421708
-
OBBTree: A hierarchical structure for rapid interface detection
-
S. Gottschalk, M. Lin, and D. Manocha. OBBTree: a hierarchical structure for rapid interface detection. In ACM Siggraph, 1996.
-
(1996)
ACM Siggraph
-
-
Gottschalk, S.1
Lin, M.2
Manocha, D.3
-
12
-
-
0011967757
-
On finding narrow passages with probabilistic roadmap planners
-
Orlando, FL
-
D. Hsu, L. E. Kavraki, J.-C. Latombe, R. Motwani, and S. Sorkin. On finding narrow passages with probabilistic roadmap planners. In Parallel and Distributed Processing IPPS/SPDP, Orlando, FL, 1998.
-
(1998)
Parallel and Distributed Processing IPPS/SPDP
-
-
Hsu, D.1
Kavraki, L.E.2
Latombe, J.-C.3
Motwani, R.4
Sorkin, S.5
-
13
-
-
0030646249
-
V-COLLIDE: Accelerated collision detection for VRML
-
T. Hudson, M. Lin, J. Cohen, S. Gottschalk, and D. Manocha. V-COLLIDE: accelerated collision detection for VRML. In 2nd Annual Symposium on the Virtual Reality Modelling Language, Monterey, CA, 1997.
-
2nd Annual Symposium on the Virtual Reality Modelling Language, Monterey, CA, 1997
-
-
Hudson, T.1
Lin, M.2
Cohen, J.3
Gottschalk, S.4
Manocha, D.5
-
14
-
-
34547376649
-
Collision detection algorithms for motion planning
-
In J.-P. Laumond, editor
-
P. Jimenéz, F. Thomas, and C. Torras. Collision detection algorithms for motion planning. In J.-P. Laumond, editor, Robot motion planning and control, number 229, chapter 6. Lecture Notes in Control and Information Sciences.
-
Robot Motion Planning and Control, Number 229, Chapter 6. Lecture Notes in Control and Information Sciences
-
-
Jimenéz, P.1
Thomas, F.2
Torras, C.3
-
15
-
-
0035311963
-
3D collision detection: A survey
-
P. Jimenéz, F. Thomas, and C. Torras. 3D collision detection: a survey. Computers and Graphics, 25(2):269-285, 2001.
-
(2001)
Computers and Graphics
, vol.25
, Issue.2
, pp. 269-285
-
-
Jimenéz, P.1
Thomas, F.2
Torras, C.3
-
16
-
-
0004125062
-
Fast proximity queries with swept sphere volumes
-
Technical Report TR99-018, Department of Computer Science, University of North Carolina, Chapel Hill
-
E. Larsen, S. Gottschalk, M. Lin, and D. Manocha. Fast proximity queries with swept sphere volumes. Technical Report TR99-018, Department of Computer Science, University of North Carolina, Chapel Hill, 1999.
-
(1999)
-
-
Larsen, E.1
Gottschalk, S.2
Lin, M.3
Manocha, D.4
-
17
-
-
0033726637
-
Fast distance queries with rectangular swept sphere volumes
-
E. Larsen, S. Gottschalk, M. Lin, and D. Manocha. Fast distance queries with rectangular swept sphere volumes. In IEEE International Conference on Robotics and Automation, San Francisco (CA), 2000.
-
IEEE International Conference on Robotics and Automation, San Francisco (CA), 2000
-
-
Larsen, E.1
Gottschalk, S.2
Lin, M.3
Manocha, D.4
-
21
-
-
0032108781
-
VClip: Fast and robust polyhedral collision detection
-
B. Mirtich. VClip: fast and robust polyhedral collision detection. ACM Transaction on Graphics, 17(3):177-208, 1998.
-
(1998)
ACM Transaction on Graphics
, vol.17
, Issue.3
, pp. 177-208
-
-
Mirtich, B.1
-
22
-
-
0001779112
-
Efficient collision detection of complex deformable models using AABB trees
-
G. van den Bergen. Efficient collision detection of complex deformable models using AABB trees. Journal of Graphic Tools, 4(2):1-13, 1997.
-
(1997)
Journal of Graphic Tools
, vol.4
, Issue.2
, pp. 1-13
-
-
Van Den Bergen, G.1
-
23
-
-
0002490645
-
A fast and robust GJK implementation for collision detection of convex objects
-
G. van den Bergen. A fast and robust GJK implementation for collision detection of convex objects. Journal of Graphics Tools, 2(4):7-25, 1999.
-
(1999)
Journal of Graphics Tools
, vol.2
, Issue.4
, pp. 7-25
-
-
Van Den Bergen, G.1
|