On the Optimality of Valence-based Connectivity Coding
| dc.contributor.author | Gotsman, Craig | en_US |
| dc.date.accessioned | 2015-02-16T07:30:16Z | |
| dc.date.available | 2015-02-16T07:30:16Z | |
| dc.date.issued | 2003 | en_US |
| dc.description.abstract | We show that the average entropy of the distribution of valences in valence sequences for the class of manifold 3D triangle meshes and the class of manifold 3D polygon meshes is strictly less than the entropy of these classes themselves. This implies that, apart from a valence sequence, another essential piece of information is needed for valence-based connectivity coding of manifold 3D meshes. Since there is no upper bound on the size of this extra piece of information, the result implies that the question of optimality of valence-based connectivity coding is still open. | en_US |
| dc.description.number | 1 | en_US |
| dc.description.seriesinformation | Computer Graphics Forum | en_US |
| dc.description.volume | 22 | en_US |
| dc.identifier.doi | 10.1111/1467-8659.t01-1-00649 | en_US |
| dc.identifier.issn | 1467-8659 | en_US |
| dc.identifier.pages | 99-102 | en_US |
| dc.identifier.uri | https://doi.org/10.1111/1467-8659.t01-1-00649 | en_US |
| dc.publisher | Blackwell Publishers, Inc and the Eurographics Association | en_US |
| dc.title | On the Optimality of Valence-based Connectivity Coding | en_US |