On the optimality of valence-based connectivity coding

Computer Graphics Forum

Volumn 22, Issue 1, 2003, Pages 99-102

  Gotsman, Craig ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

BOUNDARY CONDITIONS; COMPUTER AIDED DESIGN; ENTROPY; IMAGE CODING;

POLYGON MESHES;

THREE DIMENSIONAL COMPUTER GRAPHICS;

EID: 0037354654     PISSN: 01677055     EISSN: None     Source Type: Journal    
DOI: 10.1111/1467-8659.t01-1-00649     Document Type: Article

References (17)

1. G. Turan. On the succinct representation of graphs. Disc. Appl. Math., 8:289-294, 1984.
2. K. Keeler and J. Westbrook. Short encodings of planar graphs and maps. Disc. Appl. Math., 58:239-252, 1995.
3. J. Rossignac. Edgebreaker: Connectivity compression for triangle meshes. IEEE Transactions on Visualization and Computer Graphics. 5(1),1999.
4. D. King and J. Rossignac. Guaranteed 3.67v bit encoding of planar triangle graphs. In Proceedings of 11th Canadian Conference on Computation Geometry, pp. 146-149. 1999.
5. S. Gumhold. Improved cut-border machine for triangle mesh compression. In Proceedings of Erlangen Workshop '99 on Vision, Modeling and Visualization. IEEE, 1999.
6. R. C. Chuang, A. Garg, X. He and M. Kao. Compact encodings of planar graphs via canonical orderings and multiple parantheses. In Lecture Notes in Computer Science 1443. 1998.
7. C. Touma and C. Gotsman. Triangle mesh compression. In Proceedings of Graphics Interface '98, pp. 26-34. 1998.
8. A. Khodakovsky, P. Alliez, M. Desbrun and P. Schroeder. Near-optimal connectivity encoding of 2-manifold polygon meshes. Graphical Models, 64(3/4):147-168, 2002.
9. M. Isenburg. Compressing polygon mesh connectivity with degree duality prediction. In Proceedings of Graphics Interface. 2002.
10. W. Tutte. A census of planar triangulations. Canadian Journal of Math, 14:21-38, 1962.
11. V. A. Liskovets. A pattern of asymptotic vertex valency distributions in planar maps. Journal of Combinatorial Theory B, 75:116-13, 1999.
12. E. A. Bender and N. C. Wormald. The number of loopless planar maps. Discrete Maths, 54:235-237, 1985.
13. P. Alliez and M. Desbrun. Valence-driven connectivity encoding of 3D meshes. In Proceedings of Eurographics, pp. 480-489. 2001.
14. W. Tutte. A census of planar maps. Canadian Journal of Math, 15:249-271, 1963.
15. M. Isenburg and J. Snoeyink. Face Fixer: Compressing polygon meshes with properties. In Proceedings of SIGGRAPH. 2000.
16. B. Kronrod and C. Gotsman. Efficient coding of nontriangular mesh connectivity. Graphical Models, 63:263-275, 2001.
17. E. A. Bender and A. R. Canfield. Face sizes of 3-polytopes. Journal of Combinatorial Theory B, 46:58-65, 1989.