메뉴 건너뛰기




Volumn 3106, Issue , 2004, Pages 238-248

Efficient algorithms for approximating a multi-dimensional voxel terrain by a unimodal terrain

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS;

EID: 35048835850     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27798-9_27     Document Type: Article
Times cited : (22)

References (9)
  • 4
    • 33645215744 scopus 로고    scopus 로고
    • Linear Time Algorithm for Approximating a Curve by a Single-Peaked Curve
    • J. Chun, K. Sadakane, T. Tokuyama, Linear Time Algorithm for Approximating a Curve by a Single-Peaked Curve, Proc. 14th ISAAC, LNCS 2906 (2003), 6-16.
    • (2003) Proc. 14th ISAAC, LNCS 2906 , pp. 6-16
    • Chun, J.1    Sadakane, K.2    Tokuyama, T.3
  • 5
    • 35248859355 scopus 로고    scopus 로고
    • Efficient Algoirthms for Constructing a Pyramid from a Terrain
    • J. Chun, K. Sadakane, T. Tokuyama, Efficient Algoirthms for Constructing a Pyramid from a Terrain, Proc. JCDCG2002, LNCS 2866 (2002), 108-117.
    • (2002) Proc. JCDCG2002, LNCS 2866 , pp. 108-117
    • Chun, J.1    Sadakane, K.2    Tokuyama, T.3
  • 6
    • 0031372630 scopus 로고    scopus 로고
    • Beyond the Flow Decomposition Barrier
    • A. Goldberg and S. Rao, Beyond the Flow Decomposition Barrier, Proc. 38th IEEE FOCS (1997) 2-11.
    • (1997) Proc. 38th IEEE FOCS , pp. 2-11
    • Goldberg, A.1    Rao, S.2
  • 7
    • 0035402307 scopus 로고    scopus 로고
    • A New-old Algorithm for Minimum Cuts in Closure Graphs
    • D. S. Hochbaum, A New-old Algorithm for Minimum Cuts in Closure Graphs, Networks 37 (2001) 171-193.
    • (2001) Networks , vol.37 , pp. 171-193
    • Hochbaum, D.S.1


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