메뉴 건너뛰기




Volumn 40, Issue 3, 2004, Pages 161-172

A linear-time approximation scheme for maximum weight triangulation of convex polygons

Author keywords

Algorithm; Approximation scheme; Convex polygon; Maximum weight triangulation

Indexed keywords

ALGORITHMS; COMPUTATIONAL GEOMETRY; DYNAMIC PROGRAMMING; MATHEMATICAL OPERATORS; PROBABILITY; PROBLEM SOLVING; THEOREM PROVING;

EID: 21044456762     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00453-004-1101-6     Document Type: Article
Times cited : (6)

References (10)
  • 1
    • 0003415254 scopus 로고
    • New results on planar triangulations
    • Coord. Sci. Lab., University of Illinois at Urbana
    • Gilbert, P., New Results on Planar Triangulations, Technical Report ACT-15, Coord. Sci. Lab., University of Illinois at Urbana, 1979.
    • (1979) Technical Report , vol.ACT-15
    • Gilbert, P.1
  • 2
    • 21044431562 scopus 로고    scopus 로고
    • A constant-factor approximation for maximum weight triangulation
    • Halifax, Nova Scotia, August
    • Hu, S., A constant-factor approximation for maximum weight triangulation, Proceeding of the 15th Canadian Conference of Computational Geometry, Halifax, Nova Scotia, August 2003, pp. 150-154.
    • (2003) Proceeding of the 15th Canadian Conference of Computational Geometry , pp. 150-154
    • Hu, S.1
  • 3
    • 0000775283 scopus 로고
    • Minimal triangulations of polygonal domains
    • Klincsek, G., Minimal triangulations of polygonal domains, Annals of Discrete Mathematics 9 (1980), 121-123.
    • (1980) Annals of Discrete Mathematics , vol.9 , pp. 121-123
    • Klincsek, G.1
  • 5
    • 0006890703 scopus 로고    scopus 로고
    • A linear-time approximation scheme for minimum weight triangulation of convex polygons
    • Levcopoulos, C., and Krznaric, D., A linear-time approximation scheme for minimum weight triangulation of convex polygons, Algorithmica, 21(3) (1998), 285-311.
    • (1998) Algorithmica , vol.21 , Issue.3 , pp. 285-311
    • Levcopoulos, C.1    Krznaric, D.2
  • 6
    • 0023209499 scopus 로고
    • On approximation behavior of the greedy triangulation for convex polygon
    • Levcopoulos, C., and Lingas, A., On approximation behavior of the greedy triangulation for convex polygon, Algorithmica, 2 (1987), 175-193.
    • (1987) Algorithmica , vol.2 , pp. 175-193
    • Levcopoulos, C.1    Lingas, A.2
  • 8
    • 21044455981 scopus 로고    scopus 로고
    • Progress on maximum weight triangulation in the plane
    • Deptartment of Computer Science, Memorial University of Newfoundland, October
    • Qian, J., and Wang, C., Progress on Maximum Weight Triangulation in the Plane, Technical Report, Deptartment of Computer Science, Memorial University of Newfoundland, October, 2003.
    • (2003) Technical Report
    • Qian, J.1    Wang, C.2
  • 9
    • 0033574360 scopus 로고    scopus 로고
    • Maximum weight triangulation and graph drawing
    • Wang, C., Chin, F., and Yang, B., Maximum weight triangulation and graph drawing, Information Processing Letters, 70 (1999), 17-22.
    • (1999) Information Processing Letters , vol.70 , pp. 17-22
    • Wang, C.1    Chin, F.2    Yang, B.3
  • 10
    • 0003618433 scopus 로고
    • (translated by P. J. Kelly and L. F. Walton), Holt, Rinehart and Winston, New York
    • Yaglom, I.M, and Boltyanskli, V.G, Convex Figures (translated by P. J. Kelly and L. F. Walton), Holt, Rinehart and Winston, New York, 1961.
    • (1961) Convex Figures
    • Yaglom, I.M.1    Boltyanskli, V.G.2


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