메뉴 건너뛰기




Volumn 27, Issue 1, 2004, Pages 13-26

The weighted farthest color Voronoi diagram on trees and graphs

Author keywords

Graph; Locational planning; Network; Tree; Voronoi diagram

Indexed keywords


EID: 84867958366     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comgeo.2003.07.003     Document Type: Article
Times cited : (10)

References (12)
  • 2
    • 84976826673 scopus 로고
    • Voronoi diagrams: A survey of a fundamental geometric data structure
    • F. Aurenhammer Voronoi diagrams: A survey of a fundamental geometric data structure ACM Comput. Surv. 23 3 1991 345 405
    • (1991) ACM Comput. Surv. , vol.23 , Issue.3 , pp. 345-405
    • Aurenhammer, F.1
  • 3
    • 0021358006 scopus 로고
    • An optimal algorithm for constructing the weighted Voronoi diagram in the plane
    • F. Aurenhammer, and H. Edelsbrunner An optimal algorithm for constructing the weighted Voronoi diagram in the plane Pattern Recogn. 17 1984 251 257
    • (1984) Pattern Recogn. , vol.17 , pp. 251-257
    • Aurenhammer, F.1    Edelsbrunner, H.2
  • 4
    • 0001781555 scopus 로고    scopus 로고
    • Voronoi diagrams
    • J.-R. Sack, J. Urrutia, Elsevier Science/North-Holland Amsterdam
    • F. Aurenhammer, and R. Klein Voronoi diagrams J.-R. Sack, J. Urrutia, Handbook of Computational Geometry 2000 Elsevier Science/North-Holland Amsterdam 201 290
    • (2000) Handbook of Computational Geometry , pp. 201-290
    • Aurenhammer, F.1    Klein, R.2
  • 6
    • 0034288747 scopus 로고    scopus 로고
    • The graph Voronoi diagram with applications
    • M. Erwig The graph Voronoi diagram with applications Networks 36 2000 156 163
    • (2000) Networks , vol.36 , pp. 156-163
    • Erwig, M.1
  • 7
    • 0023384210 scopus 로고
    • Fibonacci heaps and their uses in improved network optimization algorithms
    • M.L. Fredman, and R.E. Tarjan Fibonacci heaps and their uses in improved network optimization algorithms J. ACM 34 1987 596 615
    • (1987) J. ACM , vol.34 , pp. 596-615
    • Fredman, M.L.1    Tarjan, R.E.2
  • 8
    • 0026923819 scopus 로고
    • The Voronoi partition of a network and its implications in location theory
    • S.L. Hakimi, M. Labbé, and E. Schmeichel The Voronoi partition of a network and its implications in location theory ORSA J. Comput. 4 4 1992 412 417
    • (1992) ORSA J. Comput. , vol.4 , Issue.4 , pp. 412-417
    • Hakimi, S.L.1    Labbé, M.2    Schmeichel, E.3
  • 9
    • 21144464462 scopus 로고
    • The upper envelope of Voronoi surfaces and its applications
    • D.P. Huttenlocher, K. Kedem, and M. Sharir The upper envelope of Voronoi surfaces and its applications Discrete Comput. Geom. 9 1993 267 291
    • (1993) Discrete Comput. Geom. , vol.9 , pp. 267-291
    • Huttenlocher, D.P.1    Kedem, K.2    Sharir, M.3
  • 10
    • 0023983382 scopus 로고
    • A faster approximation algorithm for the steiner problem in graphs
    • K. Mehlhorn A faster approximation algorithm for the steiner problem in graphs Inform. Process. Lett. 27 1988 125 128
    • (1988) Inform. Process. Lett. , vol.27 , pp. 125-128
    • Mehlhorn, K.1


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