메뉴 건너뛰기




Volumn 27, Issue 3, 2004, Pages 211-235

Kinetic collision detection between two simple polygons

Author keywords

Collision detection; Geodesic triangulation; Kinetic data structures

Indexed keywords


EID: 84867954569     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comgeo.2003.11.001     Document Type: Article
Times cited : (23)

References (29)
  • 4
    • 0025449463 scopus 로고
    • 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
  • 6
    • 0025214884 scopus 로고
    • 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 scopus 로고    scopus 로고
    • 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 scopus 로고    scopus 로고
    • 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
  • 13
  • 14
    • 0030189581 scopus 로고    scopus 로고
    • 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 scopus 로고    scopus 로고
    • 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
  • 18
    • 0026965551 scopus 로고
    • 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 scopus 로고    scopus 로고
    • 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 scopus 로고
    • 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 scopus 로고    scopus 로고
    • 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


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