메뉴 건너뛰기




Volumn 21, Issue 3, 1996, Pages 508-519

Ray Shooting Amidst Convex Polygons in 2D

Author keywords

[No Author keywords available]

Indexed keywords


EID: 0346615440     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.1996.0056     Document Type: Article
Times cited : (21)

References (14)
  • 1
    • 0038162963 scopus 로고
    • Ray shooting and other applications of spanning trees with low stabbing number
    • P. K. Agarwal, Ray shooting and other applications of spanning trees with low stabbing number, SIAM J. Comput. 21 (1992), 540-570.
    • (1992) SIAM J. Comput. , vol.21 , pp. 540-570
    • Agarwal, P.K.1
  • 3
    • 0027641024 scopus 로고
    • Ray shooting and parametric search
    • P. K. Agarwal and J. Matoušek, Ray shooting and parametric search, SIAM J. Comput. 22 (1993), 794-806.
    • (1993) SIAM J. Comput. , vol.22 , pp. 794-806
    • Agarwal, P.K.1    Matoušek, J.2
  • 4
    • 0040767034 scopus 로고
    • Applications of a new space partitioning technique
    • P. K. Agarwal and M. Sharir, Applications of a new space partitioning technique, Discrete Comput. Geom. 9 (1993), 11-38.
    • (1993) Discrete Comput. Geom. , vol.9 , pp. 11-38
    • Agarwal, P.K.1    Sharir, M.2
  • 5
    • 0029767166 scopus 로고    scopus 로고
    • Ray shooting amidst convex polyhedra and polyhedral terrains in three dimensions
    • P. K. Agarwal and M. Sharir, Ray shooting amidst convex polyhedra and polyhedral terrains in three dimensions, SIAM J. Comput. 25 (1996), 100-116.
    • (1996) SIAM J. Comput. , vol.25 , pp. 100-116
    • Agarwal, P.K.1    Sharir, M.2
  • 7
    • 0018515704 scopus 로고
    • Algorithms for reporting and counting geometric intersections
    • J. L. Bentley and T. Ottman, Algorithms for reporting and counting geometric intersections, IEEE Trans. Comput. C-28 (1979), 643-647.
    • (1979) IEEE Trans. Comput. , vol.C-28 , pp. 643-647
    • Bentley, J.L.1    Ottman, T.2
  • 8
    • 0026460645 scopus 로고
    • An optimal algorithm for intersecting line segments in the plane
    • B. Chazelle and H. Edelsbrunner, An optimal algorithm for intersecting line segments in the plane, J. Assoc. Comput. Mach. 39 (1992), 1-54.
    • (1992) J. Assoc. Comput. Mach. , vol.39 , pp. 1-54
    • Chazelle, B.1    Edelsbrunner, H.2
  • 10
    • 0347108150 scopus 로고
    • Visibility and intersection problems in plane geometry
    • B. Chazelle and L. Guibas, Visibility and intersection problems in plane geometry, Discrete Comput. Geom. 4 (1989), 551-589.
    • (1989) Discrete Comput. Geom. , vol.4 , pp. 551-589
    • Chazelle, B.1    Guibas, L.2
  • 11
    • 0001003454 scopus 로고
    • A pedestrian approach to ray shooting: Shool a ray, take a walk
    • J. Hershberger and S. Suri, A pedestrian approach to ray shooting: Shool a ray, take a walk, J. Algorithms 18 (1995), 403-431.
    • (1995) J. Algorithms , vol.18 , pp. 403-431
    • Hershberger, J.1    Suri, S.2
  • 12
    • 21144462806 scopus 로고
    • Efficient partition trees
    • J. Matoušek, Efficient partition trees, Discrete Comput. Geom. 8 (1992), 315-334.
    • (1992) Discrete Comput. Geom. , vol.8 , pp. 315-334
    • Matoušek, J.1
  • 14
    • 84976669340 scopus 로고
    • Planar point location using persistent search trees
    • N. Sarnak and R. Tarjan, Planar point location using persistent search trees, Comm. ACM 29 (1986), 669-679.
    • (1986) Comm. ACM , vol.29 , pp. 669-679
    • Sarnak, N.1    Tarjan, R.2


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