{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,21]],"date-time":"2026-03-21T02:08:13Z","timestamp":1774058893966,"version":"3.50.1"},"reference-count":48,"publisher":"Association for Computing Machinery (ACM)","issue":"6","license":[{"start":{"date-parts":[[2024,11,19]],"date-time":"2024-11-19T00:00:00Z","timestamp":1731974400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["497335132"],"award-info":[{"award-number":["497335132"]}],"id":[{"id":"10.13039\/501100001659","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":[[2024,12,19]]},"abstract":"<jats:p>A method for the construction of bijective volumetric maps between 3D shapes is presented. Arbitrary shapes of ball-topology are supported, overcoming restrictions of previous methods to convex or star-shaped targets. In essence, the mapping problem is decomposed into a set of simpler mapping problems, each of which can be solved with previous methods for discrete star-shaped mapping problems. Addressing the key challenges in this endeavor, algorithms are described to reliably construct structurally compatible partitions of two shapes with constraints regarding star-shapedness and to compute a parsimonious common refinement of two triangulations.<\/jats:p>","DOI":"10.1145\/3687950","type":"journal-article","created":{"date-parts":[[2024,11,19]],"date-time":"2024-11-19T15:46:04Z","timestamp":1732031164000},"page":"1-11","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Bijective Volumetric Mapping via Star Decomposition"],"prefix":"10.1145","volume":"43","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6873-4420","authenticated-orcid":false,"given":"Steffen","family":"Hinderink","sequence":"first","affiliation":[{"name":"Osnabr\u00fcck University, Osnabr\u00fcck, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4148-2619","authenticated-orcid":false,"given":"Hendrik","family":"Br\u00fcckler","sequence":"additional","affiliation":[{"name":"Osnabr\u00fcck University, Osnabr\u00fcck, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2340-3462","authenticated-orcid":false,"given":"Marcel","family":"Campen","sequence":"additional","affiliation":[{"name":"Osnabr\u00fcck University, Osnabr\u00fcck, Germany"}]}],"member":"320","published-online":{"date-parts":[[2024,11,19]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"crossref","unstructured":"Mikkel Abrahamsen Joakim Blikstad Andr\u00e9 Nusser and Hanwen Zhang. 2024. Minimum Star Partitions of Simple Polygons in Polynomial Time. arXiv:2311.10631","DOI":"10.1145\/3618260.3649756"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3572897"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2461912.2461931"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/1731309.1731311"},{"key":"e_1_2_1_5_1","volume-title":"Proc. IEEE Conference on Computer Vision and Pattern Recognition. 3794--3801","author":"Bogo Federica","unstructured":"Federica Bogo, Javier Romero, Matthew Loper, and Michael J. Black. 2014. FAUST: Dataset and evaluation for 3D mesh registration. In Proc. IEEE Conference on Computer Vision and Pattern Recognition. 3794--3801."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3618384"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897824.2925890"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.14915"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04245-8"},{"key":"e_1_2_1_10_1","volume-title":"Advances in Discrete and Computational Geometry","author":"Dey Tamal K.","unstructured":"Tamal K. Dey, Herbert Edelsbrunner, and Sumanta Guha. 1999. Computational topology. In Advances in Discrete and Computational Geometry. American Mathematical Society, 109--143."},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3618352"},{"key":"e_1_2_1_12_1","volume-title":"Minimal Surfaces","author":"Dierkes Ulrich","unstructured":"Ulrich Dierkes, Stefan Hildebrandt, and Friedrich Sauvigny. 2010. Minimal Surfaces. In Minimal Surfaces. Springer, 53--90."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3386569.3392484"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3592445"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2766938"},{"key":"e_1_2_1_16_1","volume-title":"Zur Grundlegung der kombinatorischen Topologie. Abhandlungen aus dem mathematischen Seminar der Universit\u00e4t Hamburg 3, 1","author":"Furch Robert","year":"1924","unstructured":"Robert Furch. 1924. Zur Grundlegung der kombinatorischen Topologie. Abhandlungen aus dem mathematischen Seminar der Universit\u00e4t Hamburg 3, 1 (1924), 69--88."},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2015.2473835"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3450626.3459847"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1002\/nme.808"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2006.82"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.4310\/CIS.2003.v3.n3.a4"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cad.2017.05.007"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3592410"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3386569.3392385"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3197517.3201353"},{"key":"e_1_2_1_26_1","volume-title":"Mathematics of Surfaces","author":"Kawaharada Hiroshi","unstructured":"Hiroshi Kawaharada and Kokichi Sugihara. 2003. Compression of Arbitrary Mesh Data Using Subdivision Surfaces. In Mathematics of Surfaces. Springer, 99--110."},{"key":"e_1_2_1_27_1","doi-asserted-by":"crossref","unstructured":"J. Mark Keil. 2000. Polygon Decomposition. In Handbook of Computational Geometry. North-Holland 491--518.","DOI":"10.1016\/B978-044482537-7\/50012-7"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2601097.2601142"},{"key":"e_1_2_1_29_1","volume-title":"Approximate Star-Shaped Decomposition of Point Set Data. In Eurographics Symposium on Point-Based Graphics. 73--80","author":"Lien Jyh-Ming","year":"2007","unstructured":"Jyh-Ming Lien. 2007. Approximate Star-Shaped Decomposition of Point Set Data. In Eurographics Symposium on Point-Based Graphics. 73--80."},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.15026"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2601097.2601154"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.14043"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/3592421"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/2983621"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/3130800.3130883"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.14747"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/3306346.3323012"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/2629697"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.13617"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1112\/plms\/s3-13.1.743"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.15607\/RSS.2005.I.004"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/3528223.3530103"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cam.2014.03.018"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cag.2011.04.001"},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2012.173"},{"key":"e_1_2_1_46_1","volume-title":"Proc. 8th International Conference on Computer Science & Education. 1023--1028","author":"Yu Wuyi","year":"2013","unstructured":"Wuyi Yu, Maoqing Li, and Xin Li. 2013. Optimizing Pyramid Visibiliy Coverage for Autonomous Robots in 3D Environment. In Proc. 8th International Conference on Computer Science & Education. 1023--1028."},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-8659.2011.02056.x"},{"key":"e_1_2_1_48_1","first-page":"3D","article-title":"Thingi10K","volume":"10","author":"Zhou Qingnan","year":"2016","unstructured":"Qingnan Zhou and Alec Jacobson. 2016. Thingi10K: A Dataset of 10,000 3D-Printing Models. arXiv:1605.04797","journal-title":"A Dataset of"}],"container-title":["ACM Transactions on Graphics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3687950","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3687950","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T01:09:57Z","timestamp":1750295397000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3687950"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,19]]},"references-count":48,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2024,12,19]]}},"alternative-id":["10.1145\/3687950"],"URL":"https:\/\/doi.org\/10.1145\/3687950","relation":{},"ISSN":["0730-0301","1557-7368"],"issn-type":[{"value":"0730-0301","type":"print"},{"value":"1557-7368","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,11,19]]},"assertion":[{"value":"2024-11-19","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}