메뉴 건너뛰기




Volumn , Issue , 2005, Pages 568-571

Recent advances in compression of 3D meshes

Author keywords

[No Author keywords available]

Indexed keywords

3D MESHES; 3D OBJECT; 3D SURFACE MESHES; COMPLEX SHAPES; DATA FORMAT; DATA SETS; SIMULATION APPLICATIONS;

EID: 84863671611     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (3)

References (32)
  • 5
    • 0036996256 scopus 로고    scopus 로고
    • Progressive lossless compression of arbitrary simplicial complexes
    • ACM SIGGRAPH Conference Proceedings
    • P.-M. Gandoin and O. Devillers. Progressive Lossless Compression of Arbitrary Simplicial Complexes. ACM Transactions on Graphics, 21:372.379, 2002. ACM SIGGRAPH Conference Proceedings.
    • (2002) ACM Transactions on Graphics , vol.21 , pp. 372-379
    • Gandoin, P.-M.1    Devillers, O.2
  • 10
    • 0036453603 scopus 로고    scopus 로고
    • Compressing polygon mesh connectivity with degree duality prediction
    • M. Isenburg. Compressing Polygon Mesh Connectivity with Degree Duality Prediction. In Graphics Interface Conference Proc., pages 161.170, 2002.
    • (2002) Graphics Interface Conference Proc. , pp. 161-170
    • Isenburg, M.1
  • 15
    • 0000962826 scopus 로고
    • Short encodings of planar graphs and maps
    • Keeler and Westbrook. Short Encodings of Planar Graphs and Maps. Disc. Ap. Math., 58:239.252, 1995.
    • (1995) Disc. Ap. Math. , vol.58 , pp. 239-252
    • Keeler1    Westbrook2
  • 21
    • 0035410658 scopus 로고    scopus 로고
    • Efficient coding of non-triangular mesh connectivity
    • B. Kronrod and C. Gotsman. Efficient Coding of Non-Triangular Mesh Connectivity. Graphical Models, 63(263-275), 2001.
    • (2001) Graphical Models , vol.63 , pp. 263-275
    • Kronrod, B.1    Gotsman, C.2
  • 30
    • 0035479581 scopus 로고    scopus 로고
    • An edgebreaker-based efficient compression scheme for regular meshes
    • A. Szymczak, D. King, and J. Rossignac. An Edgebreaker-Based Efficient Compression Scheme for Regular Meshes. Computational Geometry, 20(1-2):53.68, 2001.
    • (2001) Computational Geometry , vol.20 , Issue.1-2 , pp. 53-68
    • Szymczak, A.1    King, D.2    Rossignac, J.3
  • 32
    • 0021466565 scopus 로고
    • Succinct representations of graphs
    • G. Turan. Succinct Representations of Graphs. Discrete Applied Mathematics, 8:289.294, 1984.
    • (1984) Discrete Applied Mathematics , vol.8 , pp. 289-294
    • Turan, G.1


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