메뉴 건너뛰기




Volumn 32, Issue 1, 2005, Pages 1-12

Approximating the minimum triangulation of convex 3-polytopes with bounded degrees

Author keywords

Approximation algorithms; Convex 3 polytopes; Minimum triangulation

Indexed keywords


EID: 22544484811     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comgeo.2005.03.001     Document Type: Article
Times cited : (2)

References (11)
  • 4
    • 0022011993 scopus 로고
    • Arboricity and subgraph listing algorithms
    • N. Chiba, and T. Nishizeki Arboricity and subgraph listing algorithms SIAM J. Comput. 14 1985 210 223
    • (1985) SIAM J. Comput. , vol.14 , pp. 210-223
    • Chiba, N.1    Nishizeki, T.2
  • 5
    • 0035630043 scopus 로고    scopus 로고
    • Approximation for minimum triangulations of simplicial convex 3-polytopes
    • F.Y.L. Chin, S.P.Y. Fung, and C.A. Wang Approximation for minimum triangulations of simplicial convex 3-polytopes Discrete Comput. Geom. 26 4 2001 499 511 A preliminary version appeared Proceedings of 12th Annual ACM-SIAM Symposium on Discrete Algorithms 2001 128 137 (Pubitemid 33586924)
    • (2001) Discrete and Computational Geometry , vol.26 , Issue.4 , pp. 499-511
    • Chin, F.Y.L.1    Fung, S.P.Y.2    Wang, C.-A.3
  • 6
    • 0004223416 scopus 로고    scopus 로고
    • Cambridge University Press Cambridge
    • P.R. Cromwell Polyhedra 1997 Cambridge University Press Cambridge
    • (1997) Polyhedra
    • Cromwell, P.R.1


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