-
1
-
-
0036523480
-
Deformable free-space tilings for kinetic collision detection
-
P.K. Agarwal, J. Basch, L.J. Guibas, J. Hershberger, and L. Zhang Deformable free-space tilings for kinetic collision detection Internat J. Robotics Res. 21 3 2002 179 197
-
(2002)
Internat J. Robotics Res.
, vol.21
, Issue.3
, pp. 179-197
-
-
Agarwal, P.K.1
Basch, J.2
Guibas, L.J.3
Hershberger, J.4
Zhang, L.5
-
2
-
-
0032762501
-
Kinetic collision detection between two simple polygons
-
J. Basch, J. Erickson, L. Guibas, J. Hershberger, and L. Zhang Kinetic collision detection between two simple polygons Proc. 10th ACM-SIAM Sympos. Discrete Algorithms 1999 102 111
-
(1999)
Proc. 10th ACM-SIAM Sympos. Discrete Algorithms
, pp. 102-111
-
-
Basch, J.1
Erickson, J.2
Guibas, L.3
Hershberger, J.4
Zhang, L.5
-
4
-
-
0025449463
-
Collision detection by four-dimensional intersection testing
-
S. Cameron Collision detection by four-dimensional intersection testing Proc. IEEE Internat. Conf. Robot. Autom. 1990 291 302
-
(1990)
Proc. IEEE Internat. Conf. Robot. Autom.
, pp. 291-302
-
-
Cameron, S.1
-
5
-
-
0028466324
-
Ray shooting in polygons using geodesic triangulations
-
B. Chazelle, H. Edelsbrunner, M. Grigni, L. Guibas, J. Hershberger, M. Sharir, and J. Snoeyink Ray shooting in polygons using geodesic triangulations Algorithmica 12 1994 54 68
-
(1994)
Algorithmica
, vol.12
, pp. 54-68
-
-
Chazelle, B.1
Edelsbrunner, H.2
Grigni, M.3
Guibas, L.4
Hershberger, J.5
Sharir, M.6
Snoeyink, J.7
-
6
-
-
0025214884
-
Simulation of simplicity: A technique to cope with degenerate cases in geometric algorithms
-
H. Edelsbrunner, and E.P. Mücke Simulation of simplicity: A technique to cope with degenerate cases in geometric algorithms ACM Trans. Graph. 9 1 1990 66 104
-
(1990)
ACM Trans. Graph.
, vol.9
, Issue.1
, pp. 66-104
-
-
Edelsbrunner, H.1
Mücke, E.P.2
-
7
-
-
0031623513
-
Raising roofs, crashing cycles, and playing pool: Applications of a data structure for finding pairwise interactions
-
D. Eppstein, and J. Erickson Raising roofs, crashing cycles, and playing pool: Applications of a data structure for finding pairwise interactions Proc. 14th Annu. ACM Sympos. Comput. Geom. 1998 58 67
-
(1998)
Proc. 14th Annu. ACM Sympos. Comput. Geom.
, pp. 58-67
-
-
Eppstein, D.1
Erickson, J.2
-
11
-
-
0000705538
-
Fast algorithms for collision and proximity problems involving moving geometric objects
-
P. Gupta, R. Janardan, and M. Smid Fast algorithms for collision and proximity problems involving moving geometric objects Computational Geometry 6 1996 371 391
-
(1996)
Computational Geometry
, vol.6
, pp. 371-391
-
-
Gupta, P.1
Janardan, R.2
Smid, M.3
-
12
-
-
0038714818
-
Planar minimally rigid graphs and pseudo-triangulations
-
R. Haas, D. Orden, G. Rote, F. Santos, B. Servatius, H. Servatius, D. Souvaine, I. Streinu, and W. Whiteley Planar minimally rigid graphs and pseudo-triangulations Proc. 19th Annu. ACM Sympos. Comput. Geom. 2003 154 163
-
(2003)
Proc. 19th Annu. ACM Sympos. Comput. Geom.
, pp. 154-163
-
-
Haas, R.1
Orden, D.2
Rote, G.3
Santos, F.4
Servatius, B.5
Servatius, H.6
Souvaine, D.7
Streinu, I.8
Whiteley, W.9
-
13
-
-
0029373569
-
Collision detection for interactive graphics applications
-
P.M. Hubbard Collision detection for interactive graphics applications IEEE Trans. Visualization and Computer Graphics 1 3 1995 218 230
-
(1995)
IEEE Trans. Visualization and Computer Graphics
, vol.1
, Issue.3
, pp. 218-230
-
-
Hubbard, P.M.1
-
14
-
-
0030189581
-
Approximating polyhedra with spheres for time-critical collision detection
-
P.M. Hubbard Approximating polyhedra with spheres for time-critical collision detection ACM Trans. Graph. 15 3 1996 179 210
-
(1996)
ACM Trans. Graph.
, vol.15
, Issue.3
, pp. 179-210
-
-
Hubbard, P.M.1
-
16
-
-
0036361572
-
Kinetic maintenance of context-sensitive hierarchical representations for disjoint simple polygons
-
D. Kirkpatrick, and B. Speckmann Kinetic maintenance of context-sensitive hierarchical representations for disjoint simple polygons Proc. 18th Annu. ACM Sympos. Comput. Geom. 2002 179 188
-
(2002)
Proc. 18th Annu. ACM Sympos. Comput. Geom.
, pp. 179-188
-
-
Kirkpatrick, D.1
Speckmann, B.2
-
17
-
-
0031673012
-
Efficient collision detection using bounding volume hierarchies of k-DOPs
-
J. Klosowski, M. Held, Joseph S.B. Mitchell, K. Zikan, and H. Sowizral Efficient collision detection using bounding volume hierarchies of k-DOPs IEEE Trans. Visualizat. Comput. Graph. 4 1 1998 21 36
-
(1998)
IEEE Trans. Visualizat. Comput. Graph.
, vol.4
, Issue.1
, pp. 21-36
-
-
Klosowski, J.1
Held, M.2
Mitchell, J.S.B.3
Zikan, K.4
Sowizral, H.5
-
18
-
-
0026965551
-
Intersection detection and separators for simple polygons
-
D.M. Mount Intersection detection and separators for simple polygons Proc. 8th Annu. ACM Sympos. Comput. Geom. 1992 303 311
-
(1992)
Proc. 8th Annu. ACM Sympos. Comput. Geom.
, pp. 303-311
-
-
Mount, D.M.1
-
21
-
-
0030519977
-
Topologically sweeping visibility complexes via pseudo-triangulations
-
M. Pocchiola, and G. Vegter Topologically sweeping visibility complexes via pseudo-triangulations Discrete Comput. Geom. 16 1996 419 453
-
(1996)
Discrete Comput. Geom.
, vol.16
, pp. 419-453
-
-
Pocchiola, M.1
Vegter, G.2
-
23
-
-
0024144496
-
On finding lowest common ancestors: Simplification and parallelization
-
B. Schieber, and U. Vishkin On finding lowest common ancestors: Simplification and parallelization SIAM J. Comput. 17 6 1988 1253 1262
-
(1988)
SIAM J. Comput.
, vol.17
, Issue.6
, pp. 1253-1262
-
-
Schieber, B.1
Vishkin, U.2
-
27
-
-
0034504512
-
A combinatorial approach to planar non-colliding robot arm motion planning
-
IEEE
-
I. Streinu A combinatorial approach to planar non-colliding robot arm motion planning Proc. 41st Annu. IEEE Sympos. Found. Comput. Sci. 2000 IEEE 443 453
-
(2000)
Proc. 41st Annu. IEEE Sympos. Found. Comput. Sci.
, pp. 443-453
-
-
Streinu, I.1
-
28
-
-
0003828759
-
-
PhD Thesis, Dept. Comput. Sci., Johns Hopkins Univ., Baltimore, MD
-
S. Suri, Minimum link paths in polygons and related problems, PhD Thesis, Dept. Comput. Sci., Johns Hopkins Univ., Baltimore, MD, 1987
-
(1987)
Minimum Link Paths in Polygons and Related Problems
-
-
Suri, S.1
-
29
-
-
70849127318
-
-
Report SOCS-85.27, School Comput. Sci., McGill Univ., Montreal, PQ
-
G.T. Toussaint, Shortest path solves translation separability of polygons, Report SOCS-85.27, School Comput. Sci., McGill Univ., Montreal, PQ, 1985
-
(1985)
Shortest Path Solves Translation Separability of Polygons
-
-
Toussaint, G.T.1
|