{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T19:33:56Z","timestamp":1778700836376,"version":"3.51.4"},"reference-count":26,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:00:00Z","timestamp":1740096000000},"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":[[2025,2,28]]},"abstract":"<jats:p>Existing intrinsic triangulation frameworks represent powerful tools for geometry processing; however, they all require the extraction of the common subdivision between extrinsic and intrinsic triangulations for visualization and optimized data transfer. We describe an efficient and effective algorithm for directly rendering intrinsic triangulations that avoids extracting common subdivisions. Our strategy is to use GPU shaders to render the intrinsic triangulation while rasterizing extrinsic triangles. We rely on a point-location algorithm supported by a compact data structure, which requires only two values per extrinsic triangle to represent the correspondence between extrinsic and intrinsic triangulations. This data structure is easier to maintain than previous proposals while supporting all the standard topological operations for improving the intrinsic mesh quality, such as edge flips, triangle refinements, and vertex displacements. Computational experiments show that the proposed data structure is numerically robust and can process nearly degenerate triangulations. We also propose a meshless strategy to accurately transfer data from intrinsic to extrinsic triangulations without relying on the extraction of common subdivisions.<\/jats:p>","DOI":"10.1145\/3716314","type":"journal-article","created":{"date-parts":[[2025,2,3]],"date-time":"2025-02-03T09:53:56Z","timestamp":1738576436000},"page":"1-15","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Direct Rendering of Intrinsic Triangulations"],"prefix":"10.1145","volume":"44","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7873-3528","authenticated-orcid":false,"given":"Waldemar","family":"Celes","sequence":"first","affiliation":[{"name":"Computer Science Department, Tecgraf Institute, Pontifical Catholic University of Rio de Janeiro, Rio de Janeiro, Brazil"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,2,21]]},"reference":[{"key":"e_1_3_3_2_1","doi-asserted-by":"publisher","DOI":"10.1155\/2013\/380484"},{"key":"e_1_3_3_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-007-9006-1"},{"key":"e_1_3_3_4_1","doi-asserted-by":"publisher","DOI":"10.1201\/b10688"},{"key":"e_1_3_3_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00371-011-0623-6"},{"key":"e_1_3_3_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cma.2010.11.007"},{"issue":"2","key":"e_1_3_3_7_1","first-page":"299","article-title":"Optimal delaunay triangulations","volume":"22","author":"Chen Long","year":"2004","unstructured":"Long Chen and Jin-chao Xu. 2004. Optimal delaunay triangulations. Journal of Computational Mathematics 22, 2 (2004), 299\u2013308. DOI:http:\/\/www.jstor.org\/stable\/43693155","journal-title":"Journal of Computational Mathematics"},{"key":"e_1_3_3_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/160985.161150"},{"key":"e_1_3_3_9_1","doi-asserted-by":"publisher","DOI":"10.2312\/LocalChapterEvents\/ItalChap\/ItalianChapConf2008\/129-136"},{"key":"e_1_3_3_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2516971.2516977"},{"key":"e_1_3_3_11_1","volume-title":"Discrete and Computational Geometry.","author":"Devadoss Satyan L.","year":"2011","unstructured":"Satyan L. Devadoss and Joseph O\u2019Rourke. 2011. Discrete and Computational Geometry.Princeton University Press. I\u2013XI, 1\u2013255 pages."},{"key":"e_1_3_3_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00607-007-0249-8"},{"key":"e_1_3_3_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3414685.3417849"},{"key":"e_1_3_3_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3478513.3480522"},{"key":"e_1_3_3_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2007.06.003"},{"key":"e_1_3_3_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/60949"},{"key":"e_1_3_3_17_1","volume-title":"Physically Based Rendering: From Theory To Implementation (3rd. ed.)","author":"Pharr Matt","year":"2016","unstructured":"Matt Pharr, Wenzel Jakob, and Greg Humphreys. 2016. Physically Based Rendering: From Theory To Implementation (3rd. ed.). Elsevier Science."},{"key":"e_1_3_3_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3450508.3464592"},{"key":"e_1_3_3_19_1","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.14069"},{"key":"e_1_3_3_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3414685.3417839"},{"key":"e_1_3_3_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3306346.3322979"},{"key":"e_1_3_3_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3243651"},{"key":"e_1_3_3_23_1","volume-title":"Lecture Notes on Geometric Robustness","author":"Shewchuk Jonathan","year":"1999","unstructured":"Jonathan Shewchuk. 1999. Lecture Notes on Geometric Robustness. Technical Report. University of California at Berkeley."},{"key":"e_1_3_3_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/360767.360802"},{"key":"e_1_3_3_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3528223.3530175"},{"key":"e_1_3_3_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/tpami.2019.2933209"},{"key":"e_1_3_3_27_1","unstructured":"Qingnan Zhou and Alec Jacobson. 2016. Thingi10K: A dataset of 10 000 3D-printing models. arXiv:1605.04797v2. Retrieved from https:\/\/arxiv.org\/abs\/1605.04797"}],"container-title":["ACM Transactions on Graphics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3716314","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3716314","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T18:43:42Z","timestamp":1750272222000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3716314"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2,21]]},"references-count":26,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,2,28]]}},"alternative-id":["10.1145\/3716314"],"URL":"https:\/\/doi.org\/10.1145\/3716314","relation":{},"ISSN":["0730-0301","1557-7368"],"issn-type":[{"value":"0730-0301","type":"print"},{"value":"1557-7368","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,2,21]]},"assertion":[{"value":"2024-01-05","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-01-04","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-02-21","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}