{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:41:57Z","timestamp":1750308117341,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":23,"publisher":"ACM","license":[{"start":{"date-parts":[[2005,5,12]],"date-time":"2005-05-12T00:00:00Z","timestamp":1115856000000},"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":[],"published-print":{"date-parts":[[2005,5,12]]},"DOI":"10.1145\/1090122.1090146","type":"proceedings-article","created":{"date-parts":[[2005,11,7]],"date-time":"2005-11-07T17:34:39Z","timestamp":1131384879000},"page":"147-152","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Geometry prediction for high degree polygons"],"prefix":"10.1145","author":[{"given":"Martin","family":"Isenburg","sequence":"first","affiliation":[{"name":"Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ioannis","family":"Ivrissimtzis","sequence":"additional","affiliation":[{"name":"Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Gumhold","sequence":"additional","affiliation":[{"name":"Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hans-Peter","family":"Seidel","sequence":"additional","affiliation":[{"name":"Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2005,5,12]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1080\/00029890.1965.11970512"},{"volume-title":"The Discrepancy Method --- Randomness and Complexity","author":"Chazelle B.","key":"e_1_3_2_1_2_1","unstructured":"Chazelle , B. 2000. The Discrepancy Method --- Randomness and Complexity . Cambridge University Press .]] Chazelle, B. 2000. The Discrepancy Method --- Randomness and Complexity. Cambridge University Press.]]"},{"key":"e_1_3_2_1_3_1","unstructured":"Cohen-Or D. Cohen R. and Irony R. 2002. Multi-way geometry encoding. Tech. rep. Computer Science Tel Aviv University.]]  Cohen-Or D. Cohen R. and Irony R. 2002. Multi-way geometry encoding. Tech. rep. Computer Science Tel Aviv University.]]"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00371-004-0255-1"},{"volume-title":"Circulant matrices","author":"Davis P.","key":"e_1_3_2_1_5_1","unstructured":"Davis , P. 1979. Circulant matrices . Wiley-Interscience .]] Davis, P. 1979. Circulant matrices. Wiley-Interscience.]]"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/566570.566591"},{"volume-title":"Eurographics'03 Proceedings, 343--348","author":"Ibarria L.","key":"e_1_3_2_1_7_1","unstructured":"Ibarria , L. , Lindstrom , P. , Rossignac , J. , and Szymczak , A . 2003. Out-of-core compression and decompression of large n-dimensional scalar fields . In Eurographics'03 Proceedings, 343--348 .]] Ibarria, L., Lindstrom, P., Rossignac, J., and Szymczak, A. 2003. Out-of-core compression and decompression of large n-dimensional scalar fields. In Eurographics'03 Proceedings, 343--348.]]"},{"volume-title":"Visualization'02 Conference Proceedings, 141--146","author":"Isenburg M.","key":"e_1_3_2_1_8_1","unstructured":"Isenburg , M. , and Alliez , P . 2002. Compressing polygon mesh geometry with parallelogram prediction . In Visualization'02 Conference Proceedings, 141--146 .]] Isenburg, M., and Alliez, P. 2002. Compressing polygon mesh geometry with parallelogram prediction. In Visualization'02 Conference Proceedings, 141--146.]]"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1201775.882366"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/344779.344919"},{"key":"e_1_3_2_1_11_1","unstructured":"Isenburg M. and Snoeyink J. 2005. Early-split coding of triangle mesh connectivity. manuscript.]]  Isenburg M. and Snoeyink J. 2005. Early-split coding of triangle mesh connectivity. manuscript.]]"},{"key":"e_1_3_2_1_12_1","volume-title":"Graphics Interface'02 Proceedings, 161--170","author":"Isenburg M.","year":"2002","unstructured":"Isenburg , M. 2002 . Compressing polygon mesh connectivity with degree duality prediction . In Graphics Interface'02 Proceedings, 161--170 .]] Isenburg, M. 2002. Compressing polygon mesh connectivity with degree duality prediction. In Graphics Interface'02 Proceedings, 161--170.]]"},{"key":"e_1_3_2_1_13_1","volume-title":"Freelence: Compressing triangle meshes using geometric information. to appear in Eurographics'05 Proceedings","author":"K\u00e4lberer F.","year":"2005","unstructured":"K\u00e4lberer , F. , Polthier , K. , Reitebuch , U. , and Wardetzky , M . 2005 . Freelence: Compressing triangle meshes using geometric information. to appear in Eurographics'05 Proceedings , September 2005.]] K\u00e4lberer, F., Polthier, K., Reitebuch, U., and Wardetzky, M. 2005. Freelence: Compressing triangle meshes using geometric information. to appear in Eurographics'05 Proceedings, September 2005.]]"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/344779.344924"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/344779.344922"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1006\/gmod.2002.0575"},{"volume-title":"International Symposium on 3D Data Processing Visualization and Transmission, 602--608","author":"Kronrod B.","key":"e_1_3_2_1_17_1","unstructured":"Kronrod , B. , and Gotsman , C . 2002. Optimized compression of triangle mesh geometry using prediction trees . In International Symposium on 3D Data Processing Visualization and Transmission, 602--608 .]] Kronrod, B., and Gotsman, C. 2002. Optimized compression of triangle mesh geometry using prediction trees. In International Symposium on 3D Data Processing Visualization and Transmission, 602--608.]]"},{"volume-title":"Eurographics'02 Proceedings, 198--205","author":"Lee H.","key":"e_1_3_2_1_18_1","unstructured":"Lee , H. , Alliez , P. , and Desbrun , M . 2002. Angle-analyzer: A triangle-quad mesh codec . In Eurographics'02 Proceedings, 198--205 .]] Lee, H., Alliez, P., and Desbrun, M. 2002. Angle-analyzer: A triangle-quad mesh codec. In Eurographics'02 Proceedings, 198--205.]]"},{"volume-title":"Proc. of Vision Modeling and Visualization'01","author":"Shikhare D.","key":"e_1_3_2_1_19_1","unstructured":"Shikhare , D. , Bhakar , S. , and Mudur , S . 2001. Compression of 3D engineering models using automatic discovery of repeating geometric features . In Proc. of Vision Modeling and Visualization'01 , 233--240.]] Shikhare, D., Bhakar, S., and Mudur, S. 2001. Compression of 3D engineering models using automatic discovery of repeating geometric features. In Proc. of Vision Modeling and Visualization'01, 233--240.]]"},{"volume-title":"Proceedings of Symposium on Geometry Processing'03","author":"Sorkine O.","key":"e_1_3_2_1_20_1","unstructured":"Sorkine , O. , Cohen-Or , D. , and Toledo , S . 2003. High-pass quantization for mesh encoding . In Proceedings of Symposium on Geometry Processing'03 , 42--51.]] Sorkine, O., Cohen-Or, D., and Toledo, S. 2003. High-pass quantization for mesh encoding. In Proceedings of Symposium on Geometry Processing'03, 42--51.]]"},{"volume-title":"Proceedings of 12th International Meshing Roundtable, 215--224","author":"Surazhsky V.","key":"e_1_3_2_1_21_1","unstructured":"Surazhsky , V. , Alliez , P. , and Gotsman , C . 2003. Isotropic remeshing of surfaces: a local parameterization approach . In Proceedings of 12th International Meshing Roundtable, 215--224 .]] Surazhsky, V., Alliez, P., and Gotsman, C. 2003. Isotropic remeshing of surfaces: a local parameterization approach. In Proceedings of 12th International Meshing Roundtable, 215--224.]]"},{"volume-title":"Graphics Interface'98 Conference Proceedings, 26--34","author":"Touma C.","key":"e_1_3_2_1_22_1","unstructured":"Touma , C. , and Gotsman , C . 1998. Triangle mesh compression . In Graphics Interface'98 Conference Proceedings, 26--34 .]] Touma, C., and Gotsman, C. 1998. Triangle mesh compression. In Graphics Interface'98 Conference Proceedings, 26--34.]]"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/214762.214771"}],"event":{"name":"SCCG05: Spring Conference in Computer Graphics","sponsor":["SIGGRAPH ACM Special Interest Group on Computer Graphics and Interactive Techniques","HP Invent Slovakia"],"location":"Budmerice Slovakia","acronym":"SCCG05"},"container-title":["Proceedings of the 21st Spring Conference on Computer Graphics"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1090122.1090146","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1090122.1090146","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:08:17Z","timestamp":1750262897000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1090122.1090146"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,5,12]]},"references-count":23,"alternative-id":["10.1145\/1090122.1090146","10.1145\/1090122"],"URL":"https:\/\/doi.org\/10.1145\/1090122.1090146","relation":{},"subject":[],"published":{"date-parts":[[2005,5,12]]},"assertion":[{"value":"2005-05-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}