{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T18:17:32Z","timestamp":1758824252606},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"6-8","license":[{"start":{"date-parts":[[2013,4,23]],"date-time":"2013-04-23T00:00:00Z","timestamp":1366675200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Vis Comput"],"published-print":{"date-parts":[[2013,6]]},"DOI":"10.1007\/s00371-013-0808-2","type":"journal-article","created":{"date-parts":[[2013,4,22]],"date-time":"2013-04-22T12:42:02Z","timestamp":1366634522000},"page":"717-727","source":"Crossref","is-referenced-by-count":6,"title":["Triangle mesh compression along the Hamiltonian cycle"],"prefix":"10.1007","volume":"29","author":[{"given":"Jie","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Changwen","family":"Zheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaohui","family":"Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,4,23]]},"reference":[{"key":"808_CR1","doi-asserted-by":"crossref","first-page":"21","DOI":"10.4153\/CJM-1962-002-9","volume":"12","author":"W.T. Tutte","year":"1962","unstructured":"Tutte, W.T.: A census of planar triangulations. Can. J. Math. 12, 21\u201338 (1962)","journal-title":"Can. J. Math."},{"key":"808_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2010324.1964962","volume":"67","author":"T. Gurung","year":"2011","unstructured":"Gurung, T., Luffel, M., Lindstrom, P., Rossignac, J.: LR: compact connectivity representation for triangle meshes. ACM Trans. Graph. 67, 1 (2011) (Proceedings of the SIGGRAPH Conference)","journal-title":"ACM Trans. Graph."},{"key":"808_CR3","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/3-540-26808-1_1","volume-title":"Advances in Multiresolution for Geometric Modelling","author":"P. Alliez","year":"2005","unstructured":"Alliez, P., Gotsman, C.: Recent advances in compression of 3d meshes. In: Advances in Multiresolution for Geometric Modelling, pp. 3\u201326 (2005)"},{"issue":"6","key":"808_CR4","doi-asserted-by":"crossref","first-page":"688","DOI":"10.1016\/j.jvcir.2005.03.001","volume":"16","author":"J. Peng","year":"2005","unstructured":"Peng, J., Kim, C.S., Kuo, C.C.J.: Technologies for 3d mesh compression: a survey. J. Vis. Commun. Image Represent. 16(6), 688\u2013733 (2005)","journal-title":"J. Vis. Commun. Image Represent."},{"key":"808_CR5","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1145\/218380.218391","volume-title":"SIGGRAPH 95, ACM SIGGRAPH","author":"M. Deering","year":"1995","unstructured":"Deering, M.: Geometry compression. In: SIGGRAPH 95, ACM SIGGRAPH, pp. 13\u201320 (1995)"},{"key":"808_CR6","first-page":"26","volume-title":"Graphics Interface","author":"C. Touma","year":"1998","unstructured":"Touma, C., Gotsman, C.: Triangle mesh compression. In: Graphics Interface, pp. 26\u201334 (1998)"},{"key":"808_CR7","first-page":"480","volume-title":"EUROGRAPHICS 2001","author":"P. Alliez","year":"2001","unstructured":"Alliez, P., Desbrun, M.: Valence-driven connectivity encoding for 3d meshes. In: EUROGRAPHICS 2001, pp. 480\u2013489 (2001)"},{"issue":"3\u20134","key":"808_CR8","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1006\/gmod.2002.0575","volume":"64","author":"A. Khodakovsky","year":"2002","unstructured":"Khodakovsky, A., Alliez, P., Desbrun, M., Schr\u00f6der, P.: Near-optimal connectivity encoding of 2-manifold polygon meshes. Graphical Models\u2014Special issue: Processing on large polygonal meshes 64(3\u20134), 147\u2013168 (2002)","journal-title":"Graphical Models\u2014Special issue: Processing on large polygonal meshes"},{"key":"808_CR9","first-page":"383","volume-title":"EUROGRAPHICS 2002","author":"H. Lee","year":"2002","unstructured":"Lee, H., Alliez, P., Desbrun, M.: Angle-analyzer: a triangle-quad mesh codec. In: EUROGRAPHICS 2002, pp. 383\u2013392 (2002)"},{"key":"808_CR10","first-page":"89","volume-title":"Graphics Interface","author":"M. Isenburg","year":"2006","unstructured":"Isenburg, M., Snoeyink, J.: Early-split coding of triangle mesh connectivity. In: Graphics Interface, pp. 89\u201397 (2006)"},{"key":"808_CR11","first-page":"263","volume-title":"SIGGRAPH 2000, ACM SIGGRAPH","author":"M. Isenburg","year":"2000","unstructured":"Isenburg, M., Snoeyink, J.: Face fixer: compressing polygon meshes with properties. In: SIGGRAPH 2000, ACM SIGGRAPH, pp. 263\u2013270 (2000)"},{"issue":"1","key":"808_CR12","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1109\/2945.764870","volume":"5","author":"J. Rossignac","year":"1999","unstructured":"Rossignac, J.: Edgebreaker: connectivity compression for triangle meshe. IEEE Trans. Vis. Comput. Graph. 5(1), 47\u201361 (1999)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"808_CR13","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1109\/ICIS.2005.29","volume-title":"Proceedings of Fourth Annual ACIS International Conference on Computer and Information Science (ICIS \u201905)","author":"B.S. Jong","year":"2005","unstructured":"Jong, B.S., Yang, W.H., Tseng, J.L., Tsong, W.L.: An efficient connectivity compression for triangular meshes. In: Proceedings of Fourth Annual ACIS International Conference on Computer and Information Science (ICIS \u201905), pp. 583\u2013588 (2005)"},{"key":"808_CR14","first-page":"146","volume-title":"Proceedings of 11th Canadian Conference on Computational Geometry","author":"D. King","year":"1999","unstructured":"King, D., Rossignac, J.: Guaranteed 3.67v bit encoding of planar triangle graphs. In: Proceedings of 11th Canadian Conference on Computational Geometry, pp. 146\u2013149 (1999)"},{"key":"808_CR15","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/S0925-7721(99)00028-0","volume":"14","author":"J. Rossignac","year":"1999","unstructured":"Rossignac, J., Szymczak, A.: Wrap&zip decompression of the connectivity of triangle meshes compressed with edgebreaker. Comput. Geom. 14, 119\u2013135 (1999)","journal-title":"Comput. Geom."},{"key":"808_CR16","first-page":"247","volume-title":"Proceedings of 12th Canadian Conference on Computational Geometry","author":"M. Isenburg","year":"2000","unstructured":"Isenburg, M., Snoeyink, J.: Spirale reversi: reverse decoding of edgebreaker encoding. In: Proceedings of 12th Canadian Conference on Computational Geometry, pp. 247\u2013256 (2000)"},{"key":"808_CR17","volume-title":"EUROGRAPHICS 2005","author":"F. K\u00e4lberer","year":"2005","unstructured":"K\u00e4lberer, F., Polthier, K., Reitebuch, U., Wardetzky, M.: FreeLence\u2014coding with free valences. In: EUROGRAPHICS 2005, vol. 24 (2005)"},{"issue":"3","key":"808_CR18","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/0166-218X(93)E0150-W","volume":"58","author":"K. Keeler","year":"1995","unstructured":"Keeler, K., Westbrook, J.: Short encodings of planar graphs and maps. Discrete Appl. Math. 58(3), 239\u2013252 (1995)","journal-title":"Discrete Appl. Math."},{"key":"808_CR19","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1145\/237170.237216","volume-title":"SIGGRAPH 96, ACM SIGGRAPH","author":"H. Hoppe","year":"1996","unstructured":"Hoppe, H.: Progressive meshes. In: SIGGRAPH 96, ACM SIGGRAPH, pp. 99\u2013108 (1996)"},{"issue":"1","key":"808_CR20","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1109\/2945.841122","volume":"6","author":"R. Pajarola","year":"2006","unstructured":"Pajarola, R., Rossignac, J.: Compressed progressive meshes. IEEE Trans. Vis. Comput. Graph. 6(1), 79\u201393 (2006)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"808_CR21","first-page":"173","volume-title":"CGI 2000","author":"R. Pajarola","year":"2000","unstructured":"Pajarola, R., Rossignac, J.: SQUEEZE: fast and progressive decompression of triangle meshes. In: CGI 2000, pp. 173\u2013182 (2000)"},{"key":"808_CR22","first-page":"195","volume-title":"SIGGRAPH 2001, ACM SIGGRAPH","author":"P. Alliez","year":"2001","unstructured":"Alliez, P., Desbrun, M.: Progressive compression for lossless transmission of triangle meshes. In: SIGGRAPH 2001, ACM SIGGRAPH, pp. 195\u2013202 (2001)"},{"key":"808_CR23","first-page":"73","volume-title":"Proceedings of Vision, Modeling, and Visualization Workshop","author":"H. Lee","year":"2009","unstructured":"Lee, H., Lavou\u00e9, G., Dupont, F.: Adaptive coarse-to-fine quantization for optimizing rate-distortion of progressive mesh compression. In: Proceedings of Vision, Modeling, and Visualization Workshop, pp. 73\u201382 (2009)"},{"key":"808_CR24","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/s00371-011-0602-y","volume":"28","author":"H. Lee","year":"2012","unstructured":"Lee, H., Lavou\u00e9, G., Dupont, F.: Rate-distortion optimization for progressive compression of 3d mesh with color attributes. Vis. Comput. 28, 137\u2013153 (2012)","journal-title":"Vis. Comput."},{"key":"808_CR25","doi-asserted-by":"crossref","first-page":"769","DOI":"10.1007\/s00371-011-0565-z","volume":"27","author":"J.K. Ahn","year":"2011","unstructured":"Ahn, J.K., Lee, D.Y., Ahn, M., Kim, C.S.: R-D optimized progressive compression of 3d meshes using prioritized gate selection and curvature prediction. Vis. Comput. 27, 769\u2013779 (2011)","journal-title":"Vis. Comput."},{"key":"808_CR26","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1016\/j.cag.2012.03.023","volume":"36","author":"A. Maglo","year":"2012","unstructured":"Maglo, A., Courbet, C., Alliez, P., Hudelot, C.: Progressive compression of manifold polygon meshes. Comput. Graph. 36, 349\u2013359 (2012)","journal-title":"Comput. Graph."},{"issue":"3","key":"808_CR27","doi-asserted-by":"crossref","first-page":"609","DOI":"10.1145\/1073204.1073237","volume":"24","author":"J. Peng","year":"2005","unstructured":"Peng, J., Kuo, C.C.J.: Geometry-guided progressive lossless 3d mesh coding with octree (ot) decomposition. ACM Trans. Graph. 24(3), 609\u2013616 (2005) (Proceedings of the SIGGRAPH Conference)","journal-title":"ACM Trans. Graph."},{"issue":"7","key":"808_CR28","doi-asserted-by":"crossref","first-page":"2029","DOI":"10.1111\/j.1467-8659.2010.01789.x","volume":"29","author":"J. Peng","year":"2010","unstructured":"Peng, J., Huang, Y., Kuo, C.C.J., Eckstein, I., Gopi, M.: Feature oriented progressive lossless mesh coding. Comput. Graph. Forum 29(7), 2029\u20132038 (2010)","journal-title":"Comput. Graph. Forum"},{"key":"808_CR29","first-page":"1301","volume-title":"Eurographics Symposium on Geometry Processing","author":"S. Valette","year":"2009","unstructured":"Valette, S., Chaine, R., Prost, R.: Progressive lossless mesh compression via incremental parametric refinement. In: Eurographics Symposium on Geometry Processing, pp. 1301\u20131310 (2009)"},{"issue":"2","key":"808_CR30","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1109\/TVCG.2004.1260764","volume":"10","author":"S. Valette","year":"2004","unstructured":"Valette, S., Prost, R.: Wavelet-based progressive compression scheme for triangle meshes: wavemesh. IEEE Trans. Vis. Comput. Graph. 10(2), 123\u2013129 (2004)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"issue":"4","key":"808_CR31","doi-asserted-by":"crossref","first-page":"704","DOI":"10.1137\/0205049","volume":"5","author":"M.R. Garey","year":"1976","unstructured":"Garey, M.R., Johson, D.S., Tarjon, R.E.: The planar Hamiltonian circuit problem is NP-complete. SIAM J. Comput. 5(4), 704\u2013714 (1976)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"808_CR32","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/0196-6774(89)90012-6","volume":"10","author":"N. Chiba","year":"1989","unstructured":"Chiba, N., Nishizeki, T.: Hamiltonian cycle problem is linear-time solvable for 4-connected planar graphs. J. Algorithms 10(2), 187\u2013211 (1989)","journal-title":"J. Algorithms"},{"issue":"6","key":"808_CR33","doi-asserted-by":"crossref","first-page":"520","DOI":"10.1145\/214762.214771","volume":"30","author":"I.H. Witten","year":"1987","unstructured":"Witten, I.H., Neal, R.M., Cleary, J.G.: Arithmetic coding for data compression. Commun. ACM 30(6), 520\u2013540 (1987)","journal-title":"Commun. ACM"},{"key":"808_CR34","unstructured":"OpenFlipper: http:\/\/www.openflipper.org (2011)"}],"container-title":["The Visual Computer"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00371-013-0808-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00371-013-0808-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00371-013-0808-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,12]],"date-time":"2019-07-12T18:56:39Z","timestamp":1562957799000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00371-013-0808-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,4,23]]},"references-count":34,"journal-issue":{"issue":"6-8","published-print":{"date-parts":[[2013,6]]}},"alternative-id":["808"],"URL":"https:\/\/doi.org\/10.1007\/s00371-013-0808-2","relation":{},"ISSN":["0178-2789","1432-2315"],"issn-type":[{"value":"0178-2789","type":"print"},{"value":"1432-2315","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,4,23]]}}}