{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T18:17:21Z","timestamp":1758824241308,"version":"3.41.0"},"reference-count":31,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2005,7,1]],"date-time":"2005-07-01T00:00:00Z","timestamp":1120176000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Graph."],"published-print":{"date-parts":[[2005,7]]},"abstract":"<jats:p>A new progressive lossless 3D triangular mesh encoder is proposed in this work, which can encode any 3D triangular mesh with an arbitrary topological structure. Given a mesh, the quantized 3D vertices are first partitioned into an octree (OT) structure, which is then traversed from the root and gradually to the leaves. During the traversal, each 3D cell in the tree front is subdivided into eight childcells. For each cell subdivision, both local geometry and connectivity changes are encoded, where the connectivity coding is guided by the geometry coding. Furthermore, prioritized cell subdivision is performed in the tree front to provide better rate-distortion (RD) performance. Experiments show that the proposed mesh coder outperforms the kd-tree algorithm in both geometry and connectivity coding efficiency. For the geometry coding part, the range of improvement is typically around 10%~20%, but may go up to 50%~60% for meshes with highly regular geometry data and\/or tight clustering of vertices.<\/jats:p>","DOI":"10.1145\/1073204.1073237","type":"journal-article","created":{"date-parts":[[2005,11,7]],"date-time":"2005-11-07T16:00:45Z","timestamp":1131379245000},"page":"609-616","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":106,"title":["Geometry-guided progressive lossless 3D mesh coding with octree (OT) decomposition"],"prefix":"10.1145","volume":"24","author":[{"given":"Jingliang","family":"Peng","sequence":"first","affiliation":[{"name":"University of Southern California"}]},{"given":"C.-C. Jay","family":"Kuo","sequence":"additional","affiliation":[{"name":"University of Southern California"}]}],"member":"320","published-online":{"date-parts":[[2005,7]]},"reference":[{"key":"e_1_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/383259.383281"},{"key":"e_1_2_2_2_1","doi-asserted-by":"crossref","unstructured":"Alliez P. and Desbrun M. 2001. Valence-driven connectivity encoding for 3D meshes. In EUROGRAPHICS 480--489.]] Alliez P. and Desbrun M. 2001. Valence-driven connectivity encoding for 3D meshes. In EUROGRAPHICS 480--489.]]","DOI":"10.1111\/1467-8659.00541"},{"volume-title":"Proceedings of the Symposium on Multiresolution in Geometric Modeling.]]","author":"Alliez P.","key":"e_1_2_2_3_1"},{"key":"e_1_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/944020.944022"},{"key":"e_1_2_2_5_1","doi-asserted-by":"crossref","unstructured":"Bajaj C. Pascucci V. and Zhuang G. 1999. Progressive compression and transmission of arbitrary triangular meshes. In IEEE Visualization 307--316.]] Bajaj C. Pascucci V. and Zhuang G. 1999. Progressive compression and transmission of arbitrary triangular meshes. In IEEE Visualization 307--316.]]","DOI":"10.1109\/VISUAL.1999.809902"},{"key":"e_1_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0925-7721(99)00026-7"},{"volume-title":"EGRW '02: Proceedings of the 13th Eurographics workshop on Rendering, 53--64","author":"Botsch M.","key":"e_1_2_2_7_1"},{"key":"e_1_2_2_8_1","unstructured":"Cohen-Or D. Levin D. and Remez O. 1999. Progressive compression of arbitrary triangular meshes. In IEEE Visualization 67--72.]] Cohen-Or D. Levin D. and Remez O. 1999. Progressive compression of arbitrary triangular meshes. In IEEE Visualization 67--72.]]"},{"key":"e_1_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00371-004-0255-1"},{"key":"e_1_2_2_10_1","doi-asserted-by":"crossref","unstructured":"Devillers O. and Gandoin P. 2000. Geometric compression for interactive transmission. In IEEE Visualization 319--326.]] Devillers O. and Gandoin P. 2000. Geometric compression for interactive transmission. In IEEE Visualization 319--326.]]","DOI":"10.1109\/VISUAL.2000.885711"},{"key":"e_1_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/566654.566591"},{"key":"e_1_2_2_12_1","doi-asserted-by":"crossref","unstructured":"Gotsman C. Gumhold S. and Kobbelt L. 2002. Simplification and compression of 3D meshes. In Tutorials on Multiresolution in Geometric Modelling.]] Gotsman C. Gumhold S. and Kobbelt L. 2002. Simplification and compression of 3D meshes. In Tutorials on Multiresolution in Geometric Modelling.]]","DOI":"10.1007\/978-3-662-04388-2_12"},{"key":"e_1_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/280814.280836"},{"key":"e_1_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/237170.237216"},{"key":"e_1_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/344779.344924"},{"key":"e_1_2_2_16_1","unstructured":"Khodakovsky A. and Guskov I. 2000. Normal mesh compression. Preprint.]] Khodakovsky A. and Guskov I. 2000. Normal mesh compression. Preprint.]]"},{"key":"e_1_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/344779.344922"},{"volume-title":"Proceedings of the First International Symposium on 3D Data Processing, Visualization, and Transmission, 470--479","author":"Laney D.","key":"e_1_2_2_18_1"},{"key":"e_1_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1201775.882294"},{"key":"e_1_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/MMCS.1997.609586"},{"key":"e_1_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/2945.841122"},{"key":"e_1_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jvcir.2005.03.001"},{"key":"e_1_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/258734.258852"},{"key":"e_1_2_2_24_1","unstructured":"Rossignac J. and Borrel P. 1993. Geometric Modeling in Computer Graphics. Springer-Verlag Jul.]] Rossignac J. and Borrel P. 1993. Geometric Modeling in Computer Graphics. Springer-Verlag Jul.]]"},{"key":"e_1_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/2945.764870"},{"volume-title":"Proceedings of Vision, Modeling and Visualization, 333--340","author":"Saupe D.","key":"e_1_2_2_26_1"},{"volume-title":"IEEE Virtual Reality Annual International Symposium, 12--19","author":"Schmalstieg D.","key":"e_1_2_2_27_1"},{"key":"e_1_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1006\/gmod.2002.0577"},{"key":"e_1_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/274363.274365"},{"key":"e_1_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/280814.280834"},{"volume-title":"Proceedings of Graphics Interface, 26--34","author":"Touma C.","key":"e_1_2_2_31_1"}],"container-title":["ACM Transactions on Graphics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1073204.1073237","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1073204.1073237","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:07:45Z","timestamp":1750262865000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1073204.1073237"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,7]]},"references-count":31,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2005,7]]}},"alternative-id":["10.1145\/1073204.1073237"],"URL":"https:\/\/doi.org\/10.1145\/1073204.1073237","relation":{},"ISSN":["0730-0301","1557-7368"],"issn-type":[{"type":"print","value":"0730-0301"},{"type":"electronic","value":"1557-7368"}],"subject":[],"published":{"date-parts":[[2005,7]]},"assertion":[{"value":"2005-07-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}