{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T20:34:42Z","timestamp":1771533282793,"version":"3.50.1"},"reference-count":21,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2011,7,1]],"date-time":"2011-07-01T00:00:00Z","timestamp":1309478400000},"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":[[2011,7]]},"abstract":"<jats:p>\n            We propose LR (\n            <jats:italic>Laced Ring<\/jats:italic>\n            )---a simple data structure for representing the connectivity of manifold triangle meshes. LR provides the option to store on average either 1.08 references per triangle or 26.2 bits per triangle. Its construction, from an input mesh that supports constant-time adjacency queries, has linear space and time complexity, and involves ordering most vertices along a nearly-Hamiltonian cycle. LR is best suited for applications that process meshes with fixed connectivity, as any changes to the connectivity require the data structure to be rebuilt. We provide an implementation of the set of standard random-access, constant-time operators for traversing a mesh, and show that LR often saves both space and traversal time over competing representations.\n          <\/jats:p>","DOI":"10.1145\/2010324.1964962","type":"journal-article","created":{"date-parts":[[2011,7,26]],"date-time":"2011-07-26T14:17:46Z","timestamp":1311689866000},"page":"1-8","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":25,"title":["LR"],"prefix":"10.1145","volume":"30","author":[{"given":"Topraj","family":"Gurung","sequence":"first","affiliation":[{"name":"Georgia Institute of Technology"}]},{"given":"Mark","family":"Luffel","sequence":"additional","affiliation":[{"name":"Georgia Institute of Technology"}]},{"given":"Peter","family":"Lindstrom","sequence":"additional","affiliation":[{"name":"Lawrence Livermore National Laboratory"}]},{"given":"Jarek","family":"Rossignac","sequence":"additional","affiliation":[{"name":"Georgia Institute of Technology"}]}],"member":"320","published-online":{"date-parts":[[2011,7,25]]},"reference":[{"key":"e_1_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01782475"},{"key":"e_1_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0218195905001580"},{"key":"e_1_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/73833.73858"},{"key":"e_1_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1080\/10867651.1998.10487494"},{"key":"e_1_2_2_6_1","volume-title":"Canadian Conference on Computational Geometry, 71--74","author":"Castelli Aleardi L.","unstructured":"Castelli Aleardi, L., Devillers, O., and Mebarki, A. 2006. 2D triangulation representation using stable catalogs. In Canadian Conference on Computational Geometry, 71--74."},{"key":"e_1_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1137856.1137902"},{"key":"e_1_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/1735603.1735611"},{"key":"e_1_2_2_9_1","doi-asserted-by":"publisher","unstructured":"Evans F. Skiena S. and Varshney A. 1996. Optimizing triangle strips for fast rendering. In IEEE Visualization 319--326.","DOI":"10.5555\/244979.245626"},{"key":"e_1_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-8659.2004.00768.x"},{"key":"e_1_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/282918.282923"},{"key":"e_1_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-8659.2011.01866.x"},{"key":"e_1_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1080\/10867651.2001.10487533"},{"key":"e_1_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1006\/gmod.2002.0575"},{"key":"e_1_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/60949"},{"key":"e_1_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/304012.304016"},{"key":"e_1_2_2_18_1","volume-title":"From object modelling to advanced visualization","author":"Rossignac J.","unstructured":"Rossignac, J. 1994. Through the cracks of the solid modeling milestone. In From object modelling to advanced visualization. Springer Verlag, 1--75."},{"key":"e_1_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/2945.764870"},{"key":"e_1_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/882486.884089"},{"key":"e_1_2_2_21_1","volume-title":"Tripod: A minimalist data structure for embedded triangulations. In Computational Graph Theory and Combinatorics.","author":"Snoeyink J.","year":"1999","unstructured":"Snoeyink, J., and Speckmann, B. 1999. Tripod: A minimalist data structure for embedded triangulations. In Computational Graph Theory and Combinatorics."},{"key":"e_1_2_2_22_1","unstructured":"Upadhyay A. K. 2010. Contractible Hamiltonian cycles in triangulated surfaces. http:\/\/arxiv.org\/pdf\/1003.5268."},{"key":"e_1_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2007.70585"}],"container-title":["ACM Transactions on Graphics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2010324.1964962","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2010324.1964962","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:06:23Z","timestamp":1750244783000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2010324.1964962"}},"subtitle":["compact connectivity representation for triangle meshes"],"short-title":[],"issued":{"date-parts":[[2011,7]]},"references-count":21,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2011,7]]}},"alternative-id":["10.1145\/2010324.1964962"],"URL":"https:\/\/doi.org\/10.1145\/2010324.1964962","relation":{},"ISSN":["0730-0301","1557-7368"],"issn-type":[{"value":"0730-0301","type":"print"},{"value":"1557-7368","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,7]]},"assertion":[{"value":"2011-07-25","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}