메뉴 건너뛰기




Volumn 122, Issue 1-3, 2002, Pages 37-54

2-Point site Voronoi diagrams

Author keywords

Davenport Schinzel theory; Distance function; Lower envelope; Voronoi diagram

Indexed keywords


EID: 84867948422     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(01)00320-1     Document Type: Article
Times cited : (28)

References (13)
  • 3
    • 0027576510 scopus 로고
    • On the zone theorem for hyperplane arrangement
    • H. Edelsbrunner, R. Seidel, and M. Sharir On the zone theorem for hyperplane arrangement SIAM J. Comput. 2 1993 418 429
    • (1993) SIAM J. Comput. , vol.2 , pp. 418-429
    • Edelsbrunner, H.1    Seidel, R.2    Sharir, M.3
  • 5
    • 0001160943 scopus 로고
    • Computing convolutions by reciprocal search
    • L.J. Guibas, and R. Seidel Computing convolutions by reciprocal search Discrete Comput. Geom. 2 1987 175 193
    • (1987) Discrete Comput. Geom. , vol.2 , pp. 175-193
    • Guibas, L.J.1    Seidel, R.2
  • 6
    • 0020141081 scopus 로고
    • On k-nearest neighbor Voronoi diagrams in the plane
    • D.T. Lee On k-nearest neighbor Voronoi diagrams in the plane IEEE Trans. Comput. 31 1982 478 487
    • (1982) IEEE Trans. Comput. , vol.31 , pp. 478-487
    • Lee, D.T.1
  • 7
    • 0002058718 scopus 로고
    • Generalization of Voronoi diagrams in the plane
    • D.T. Lee, R.L. Drysdale, III, Generalization of Voronoi diagrams in the plane, SIAM J. Comput. 10 (1981) 73-87.
    • (1981) SIAM J. Comput. , vol.10 , pp. 73-87
    • Lee, D.T.1    Drysdale Iii, R.L.2
  • 13
    • 0346755279 scopus 로고
    • An O (n log n) algorithm for the Voronoi diagram of a set of simple curve segments
    • C.-K. Yap An O (n log n) algorithm for the Voronoi diagram of a set of simple curve segments Discrete Comput. Geom. 2 1987 365 393
    • (1987) Discrete Comput. Geom. , vol.2 , pp. 365-393
    • Yap, C.-K.1


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