메뉴 건너뛰기




Volumn 9, Issue C, 1980, Pages 121-123

Minimal triangulations of polygonal domains

Author keywords

[No Author keywords available]

Indexed keywords


EID: 0000775283     PISSN: 01675060     EISSN: None     Source Type: Book Series    
DOI: 10.1016/S0167-5060(08)70044-X     Document Type: Article
Times cited : (135)

References (3)
  • 2
    • 0001773747 scopus 로고
    • Neither the Greedy nor the Delaunay Triangulation of a planar point set approximates the optimal triangulation
    • Manacher, G.K., Zobrist, A.L., Neither the Greedy nor the Delaunay Triangulation of a planar point set approximates the optimal triangulation. Information Processing Letters 9 (1979), 31–34.
    • (1979) Information Processing Letters , vol.9 , pp. 31-34
    • Manacher, G.K.1    Zobrist, A.L.2
  • 3
    • 85059200022 scopus 로고    scopus 로고
    • Proceedings of the Seventh ACM Symposium on the Theory of Computing (1975) 224–233.
    • M.I. Shamos, Geometric complexity, Proceedings of the Seventh ACM Symposium on the Theory of Computing (1975) 224–233.
    • Geometric complexity
    • Shamos, M.I.1


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