SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

International Journal of Computational Geometry and Applications

Volumn 12, Issue 1-2, 2002, Pages 3-27

Kinetic collision detection for simple polygons

(3) Kirkpatrick, David a Snoeyink, Jack b Speckmann, Bettina a

a UNIVERSITY OF BRITISH COLUMBIA (Canada)

b Brooks Computer Science Building (United States)

Author keywords

Collision detection; Kinetic data structures; Minimum link separation

Indexed keywords

EID: 0036002805 PISSN: 02181959 EISSN: None Source Type: Journal
DOI: 10.1142/s0218195902000724 Document Type: Conference Paper

Times cited : (47)

References (25)

1
- 0032690703
- Lower bounds for kinetic planar subdivisions
- (1999) Proc. 15th ACM Sympos. Comp. Geom. , pp. 247-254
- Agarwal, P.K.¹ Basch, J.² De Berg, M.³ Guibas, L.J.⁴ Hershberger, J.⁵

2
- 0002629537
- Deformable free space tilings for kinetic collision detection
- B. R. Donald, K. Lynch, and D. Rus, editors. A. K. Peters
- (2001) Algorithmic and Computational Robotics: New Directions (Proc. 5th Workshop Algorithmic Found. Robotics) , pp. 83-96
- Agarwal, P.K.¹ Basch, J.² Guibas, L.J.³ Hershberger, J.⁴ Zhang, L.⁵

3
- 0032762501
- Kinetic collision detection for two simple polygons
- (1999) Proc. 10th ACM-SIAM Sympos. Discrete Algorithms , pp. 102-111
- Basch, J.¹ Eriekson, J.² Guibas, L.J.³ Hershberger, J.⁴ Zhang, L.⁵

4
- 0030733699
- Data structures for mobile data
- (1997) Proc. 8th ACM-SIAM Sympos. Discrete Algorithms , pp. 747-756
- Basch, J.¹ Guibas, L.² Hershberger, J.³

5
- 0030679922
- A practical evaluation of kinetic data structures
- (1997) Proc. 13th ACM Sympos. Comp. Geom. , pp. 388-390
- Basch, J.¹ Guibas, L.² Silverstein, C.³ Zhang, L.⁴

6
- 0030686637
- Proximity problems on moving points
- (1997) Proc. 13th Annu. ACM Sympos. Comput. Geom. , pp. 344-351
- Basch, J.¹ Guibas, L.J.² Zhang, L.³

7
- 0028466324
- Ray shooting in polygons using geodesic triangulations
- (1994) Algorithmica , vol.12 , pp. 54-68
- Chazelle, B.¹ Edelsbrunner, H.² Grigni, M.³ Guibas, L.J.⁴ Hershberger, J.⁵ Sharir, M.⁶ Snoeyink, J.⁷

8
- 0003772933
- Springer-Verlag, Berlin
- (1997) Computational Geometry: Algorithms and Applications
- De Berg, M.¹ Van Kreveld, M.² Overmars, M.³ Schwarzkopf, O.⁴

9
- 0032803598
- Separation-sensitive collision detection for convex objects
- (1999) Proc. 10th ACM-SIAM Sympos. Discrete Algorithms , pp. 327-336
- Erickson, J.¹ Guibas, L.² Stolfi, J.³ Zhang, L.⁴

10
- 0000887452
- Efficiently planning compliant motion in the plane
- (1996) SIAM J. Comput. , vol.25 , pp. 562-599
- Friedman, J.¹ Hershberger, J.² Snoeyink, J.³

11
- 29544431731
- Compact Voronoi diagrams for moving convex polygons
- Proc. 7th Scandinavian Workshop on Algorithm Theory. Springer Verlag
- (2000) Lecture Notes Comp. Sci. , vol.1851 , pp. 339-352
- Guibas, L.¹ Snoeyink, J.² Zhang, L.³

12
- 0001802201
- Kinetic data structures: A state of the art report
- (1998) Proc. 3rd Workshop Algorithmic Found. Robotics , pp. 191-209
- Guibas, L.J.¹

13
- 0001757682
- Approximating polygons and subdivisions with minimum link paths
- Dec.
- (1993) Internat. J. Comput. Geom. Appl. , vol.3 , Issue.4 , pp. 383-415
- Guibas, L.J.¹ Hershberger, J.E.² Mitchell, J.S.B.³ Snoeyink, J.S.⁴

14
- 0029373569
- Collision detection for interactive graphics applications
- Sept.
- (1995) IEEE Transactions on Visualization and Computer Graphics , vol.1 , Issue.3 , pp. 218-230
- Hubbard, P.M.¹

15
- 84976779927
- Efficient algorithms for Euclidean shortest path and visibility problems with polygonal obstacles
- (1988) Proc. 4th Annu. ACM Sympos. Comput. Geom. , pp. 172-182
- Kapoor, S.¹ Maheshwari, S.N.²

16
- 0031502943
- An efficient algorithm for Euclidean shortest paths among polygonal obstacles in the plane
- (1997) Discrete Comput. Geom. , vol.18 , pp. 377-383
- Kapoor, S.¹ Maheshwari, S.N.² Mitchell, J.S.B.³

17
- 84974730849
- Separation sensitive kinetic separation structures for convex polygons
- Proc. Japan Conference on Discrete and Computational Geometry. Springer Verlag
- (2001) Lecture Notes Comp. Sci. , vol.2098 , pp. 222-236
- Kirkpatrick, D.¹ Speckmann, B.²

18
- 0018533130
- An algorithm for planning collision-free paths among polyhedral obstacles
- (1979) Commun. ACM , vol.22 , Issue.10 , pp. 560-570
- Lozano-Pérez, T.¹ Wesley, M.A.²

19
- 0030549637
- A compact piecewise-linear Voronoi diagram for convex sites in the plane
- (1996) Discrete Comp. Geom. , vol.15 , pp. 73-105
- McAllister, M.¹ Kirkpatrick, D.² Snoeyink, J.³

20
- 0003538552
- Prentice Hall, Englewood Cliffs, NJ
- (1993) Computational Geometry: An Introduction Through Randomized Algorithms
- Mulmuley, K.¹

21
- 34748864359
- A "retraction" method for planning the motion of a disk
- (1985) J. Algorithms , vol.6 , pp. 104-111
- Ó'Dúnlaing, C.¹ Yap, C.K.²

22
- 0002398471
- Planar point location revisited
- (1990) Internat. J. Found. Comput. Sci. , vol.1 , Issue.1 , pp. 71-86
- Preparata, F.P.¹

23
- 0004004746
- Ph.D. thesis, Bayerische Julius-Maximilians-Univ., Würzburg, Germany, Sept.
- (1991) Dynamic Voronoi diagrams
- Roos, T.¹

24
- 0000417936
- Coordinated motion planning for two independent robots
- (1991) Ann. Math, Artif. Intell. , vol.3 , pp. 107-130
- Sharir, M.¹ Sifrony, S.²

25
- 0003828759
- PhD thesis, Dept. of Computer Science, Johns Hopkins Univ.
- (1987) Minimum link paths in polygons and related problems
- Suri, S.¹

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.