{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,14]],"date-time":"2026-04-14T06:42:25Z","timestamp":1776148945345,"version":"3.50.1"},"reference-count":31,"publisher":"Association for Computing Machinery (ACM)","issue":"6","license":[{"start":{"date-parts":[[2013,11,1]],"date-time":"2013-11-01T00:00:00Z","timestamp":1383264000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100000161","name":"Networks of Centres of Excellence of Canada","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000161","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100005247","name":"University of British Columbia","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100005247","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004489","name":"Mitacs","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004489","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Graph."],"published-print":{"date-parts":[[2013,11]]},"abstract":"<jats:p>\n            PolyCubes, or orthogonal polyhedra, are useful as parameterization base-complexes for various operations in computer graphics. However, computing quality PolyCube base-complexes for general shapes, providing a good trade-off between mapping distortion and singularity counts, remains a challenge. Our work improves on the state-of-the-art in PolyCube computation by adopting a graph-cut inspired approach. We observe that, given an arbitrary input mesh, the computation of a suitable PolyCube base-complex can be formulated as associating, or labeling, each input mesh triangle with one of six signed principal axis directions. Most of the criteria for a desirable PolyCube labeling can be satisfied using a multi-label graph-cut optimization with suitable\n            <jats:italic>local<\/jats:italic>\n            unary and pairwise terms. However, the highly constrained nature of PolyCubes, imposed by the need to align each chart with one of the principal axes, enforces additional\n            <jats:italic>global<\/jats:italic>\n            constraints that the labeling must satisfy. To enforce these constraints, we develop a constrained discrete optimization technique,\n            <jats:italic>PolyCut<\/jats:italic>\n            , which embeds a graph-cut multi-label optimization within a hill-climbing local search framework that looks for solutions that minimize the cut energy while satisfying the global constraints. We further optimize our generated PolyCube base-complexes through a combination of distortion-minimizing deformation, followed by a labeling update and a final PolyCube parameterization step. Our\n            <jats:italic>PolyCut<\/jats:italic>\n            formulation captures the desired properties of a PolyCube base-complex, balancing parameterization distortion against singularity count, and produces demonstrably better PolyCube base-complexes then previous work.\n          <\/jats:p>","DOI":"10.1145\/2508363.2508388","type":"journal-article","created":{"date-parts":[[2013,11,6]],"date-time":"2013-11-06T14:09:19Z","timestamp":1383746959000},"page":"1-12","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":92,"title":["PolyCut"],"prefix":"10.1145","volume":"32","author":[{"given":"Marco","family":"Livesu","sequence":"first","affiliation":[{"name":"Universita' di Cagliari"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicholas","family":"Vining","sequence":"additional","affiliation":[{"name":"University of British Columbia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alla","family":"Sheffer","sequence":"additional","affiliation":[{"name":"University of British Columbia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"James","family":"Gregson","sequence":"additional","affiliation":[{"name":"University of British Columbia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Riccardo","family":"Scateni","sequence":"additional","affiliation":[{"name":"Universita' di Cagliari"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,11]]},"reference":[{"key":"e_1_2_2_1_1","unstructured":"Alice Project-team. Graphite. http:\/\/alice.loria.fr\/software\/graphite\/.  Alice Project-team. Graphite. http:\/\/alice.loria.fr\/software\/graphite\/."},{"key":"e_1_2_2_2_1","doi-asserted-by":"crossref","unstructured":"Bommes D. L\u00e9vy B. Pietroni N. Puppo E. Silva C. Tarini M. and Zorin D. 2013. Quad-mesh generation and processing: A survey. Computer Graphics Forum.  Bommes D. L\u00e9vy B. Pietroni N. Puppo E. Silva C. Tarini M. and Zorin D. 2013. Quad-mesh generation and processing: A survey. Computer Graphics Forum .","DOI":"10.1111\/cgf.12014"},{"key":"e_1_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2004.60"},{"key":"e_1_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/34.969114"},{"key":"e_1_2_2_5_1","first-page":"291","article-title":"Texture tiling on 3d models using automatic polycube-maps and wang tiles","volume":"26","author":"Chang C.-C.","year":"2010","journal-title":"J. Inf. Sci. Eng."},{"key":"e_1_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1810959.1811030"},{"key":"e_1_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-8659.2011.02015.x"},{"key":"e_1_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/566654.566589"},{"key":"e_1_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1839778.1839796"},{"key":"e_1_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cag.2009.03.024"},{"key":"e_1_2_2_11_1","unstructured":"Hoos H. and Sttzle T. 2004. Stochastic Local Search: Foundations & Applications. Morgan Kaufmann Publishers Inc. San Francisco CA USA.   Hoos H. and Sttzle T. 2004. Stochastic Local Search: Foundations & Applications . Morgan Kaufmann Publishers Inc. San Francisco CA USA."},{"key":"e_1_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1183287.1183295"},{"key":"e_1_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1186822.1073229"},{"key":"e_1_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2004.1262177"},{"key":"e_1_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1778765.1778856"},{"key":"e_1_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cag.2012.03.007"},{"key":"e_1_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/SMI.2010.40"},{"key":"e_1_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cag.2010.03.004"},{"key":"e_1_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2012.177"},{"key":"e_1_2_2_20_1","volume-title":"Proc. Advances in geometric modeling and processing, 3--16","author":"Lin J."},{"key":"e_1_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/882262.882274"},{"key":"e_1_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-8659.2007.01103.x"},{"key":"e_1_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1561\/0600000011"},{"key":"e_1_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1015706.1015810"},{"key":"e_1_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cag.2011.03.018"},{"key":"e_1_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1236246.1236281"},{"key":"e_1_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1364901.1364958"},{"key":"e_1_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/SMI.2010.10"},{"key":"e_1_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1944745.1944771"},{"key":"e_1_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cagd.2011.07.001"},{"key":"e_1_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2008.39"}],"container-title":["ACM Transactions on Graphics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2508363.2508388","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2508363.2508388","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:28:38Z","timestamp":1750231718000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2508363.2508388"}},"subtitle":["monotone graph-cuts for PolyCube base-complex construction"],"short-title":[],"issued":{"date-parts":[[2013,11]]},"references-count":31,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2013,11]]}},"alternative-id":["10.1145\/2508363.2508388"],"URL":"https:\/\/doi.org\/10.1145\/2508363.2508388","relation":{},"ISSN":["0730-0301","1557-7368"],"issn-type":[{"value":"0730-0301","type":"print"},{"value":"1557-7368","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,11]]},"assertion":[{"value":"2013-11-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}