{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,26]],"date-time":"2025-10-26T20:53:45Z","timestamp":1761512025013},"reference-count":17,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T00:00:00Z","timestamp":1049673600000},"content-version":"vor","delay-in-days":37,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Computer Graphics Forum"],"published-print":{"date-parts":[[2003,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p> <jats:italic>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\u2010based 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\u2010based connectivity coding is still open.<\/jats:italic> <\/jats:p>","DOI":"10.1111\/1467-8659.t01-1-00649","type":"journal-article","created":{"date-parts":[[2004,12,22]],"date-time":"2004-12-22T00:46:27Z","timestamp":1103676387000},"page":"99-102","update-policy":"http:\/\/dx.doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["On the Optimality of Valence\u2010based Connectivity Coding"],"prefix":"10.1111","volume":"22","author":[{"given":"Craig","family":"Gotsman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2003,4,7]]},"reference":[{"key":"e_1_2_6_2_2","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(84)90126-4"},{"key":"e_1_2_6_3_2","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(93)E0150-W"},{"key":"e_1_2_6_4_2","doi-asserted-by":"publisher","DOI":"10.1109\/2945.764870"},{"key":"e_1_2_6_5_2","first-page":"146","article-title":"Guaranteed 3.67v bit encoding of planar triangle graphs","author":"King D.","year":"1999","journal-title":"Proceedings of 11th Canadian Conference on Computation Geometry"},{"key":"e_1_2_6_6_2","article-title":"Improved cut\u2010border machine for triangle mesh compression","author":"Gumhold S.","year":"1999","journal-title":"Proceedings of Erlangen Workshop '99 on Vision, Modeling and Visualization"},{"key":"e_1_2_6_7_2","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0055046"},{"key":"e_1_2_6_8_2","first-page":"26","article-title":"Triangle mesh compression","author":"Touma C.","year":"1998","journal-title":"Proceedings of Graphics Interface '98"},{"key":"e_1_2_6_9_2","doi-asserted-by":"publisher","DOI":"10.1006\/gmod.2002.0575"},{"key":"e_1_2_6_10_2","article-title":"Compressing polygon mesh connectivity with degree duality prediction","author":"Isenburg M.","year":"2002","journal-title":"Proceedings of Graphics Interface"},{"key":"e_1_2_6_11_2","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1962-002-9"},{"key":"e_1_2_6_12_2","doi-asserted-by":"publisher","DOI":"10.1006\/jctb.1998.1870"},{"key":"e_1_2_6_13_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(85)90084-6"},{"key":"e_1_2_6_14_2","first-page":"480","article-title":"Valence\u2010driven connectivity encoding of 3D meshes","author":"Alliez P.","year":"2001","journal-title":"Proceedings of Eurographics"},{"key":"e_1_2_6_15_2","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1963-029-x"},{"key":"e_1_2_6_16_2","doi-asserted-by":"publisher","DOI":"10.1145\/344779.344919"},{"key":"e_1_2_6_17_2","doi-asserted-by":"publisher","DOI":"10.1006\/gmod.2001.0555"},{"key":"e_1_2_6_18_2","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(89)90007-5"}],"container-title":["Computer Graphics Forum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1111%2F1467-8659.t01-1-00649","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1111\/1467-8659.t01-1-00649","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,16]],"date-time":"2023-10-16T00:00:33Z","timestamp":1697414433000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1111\/1467-8659.t01-1-00649"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,3]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,3]]}},"alternative-id":["10.1111\/1467-8659.t01-1-00649"],"URL":"https:\/\/doi.org\/10.1111\/1467-8659.t01-1-00649","archive":["Portico"],"relation":{},"ISSN":["0167-7055","1467-8659"],"issn-type":[{"value":"0167-7055","type":"print"},{"value":"1467-8659","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003,3]]},"assertion":[{"value":"2003-04-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}