{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T11:46:07Z","timestamp":1775043967313,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":16,"publisher":"ACM","funder":[{"name":"JSPS Kakenhi","award":["23K16906"],"award-info":[{"award-number":["23K16906"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,5,26]]},"DOI":"10.1145\/3769872.3769901","type":"proceedings-article","created":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T09:46:18Z","timestamp":1775036778000},"page":"1-8","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Computing Geodesic Path Distances in Toggleable Regular Grid"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7823-0864","authenticated-orcid":false,"given":"Seung-Tak","family":"Noh","sequence":"first","affiliation":[{"name":"Computer Science, Tokyo City University, Tokyo, Japan and Prometech CG Research, Tokyo, Japan"}]}],"member":"320","published-online":{"date-parts":[[2026,4]]},"reference":[{"key":"e_1_3_3_2_2_2","doi-asserted-by":"publisher","unstructured":"Yanqing Chen Timothy\u00a0A. Davis William\u00a0W. Hager and Sivasankaran Rajamanickam. 2008. Algorithm 887: CHOLMOD Supernodal Sparse Cholesky Factorization and Update\/Downdate. ACM Trans. Math. Softw. 35 3 Article 22 (Oct. 2008). 10.1145\/1391989.1391995","DOI":"10.1145\/1391989.1391995"},{"key":"e_1_3_3_2_3_2","unstructured":"Keenan Crane Marco Livesu Enrico Puppo and Yipeng Qin. 2020. A Survey of Algorithms for Geodesic Paths and Distances. CoRR abs\/2007.10430 (2020). arXiv:https:\/\/arXiv.org\/abs\/2007.10430https:\/\/arxiv.org\/abs\/2007.10430"},{"key":"e_1_3_3_2_4_2","doi-asserted-by":"publisher","unstructured":"Keenan Crane Clarisse Weischedel and Max Wardetzky. 2013. Geodesics in heat: A new approach to computing distance based on heat flow. ACM Trans. Graph. 32 5 Article 152 (Oct. 2013). 10.1145\/2516971.2516977","DOI":"10.1145\/2516971.2516977"},{"key":"e_1_3_3_2_5_2","doi-asserted-by":"publisher","unstructured":"Keenan Crane Clarisse Weischedel and Max Wardetzky. 2017. The heat method for distance computation. Commun. ACM 60 11 (Oct. 2017) 90\u201399. 10.1145\/3131280","DOI":"10.1145\/3131280"},{"key":"e_1_3_3_2_6_2","doi-asserted-by":"publisher","unstructured":"Timothy\u00a0A. Davis and Yifan Hu. 2011. The university of Florida sparse matrix collection. ACM Trans. Math. Softw. 38 1 Article 1 (Dec. 2011). 10.1145\/2049662.2049663","DOI":"10.1145\/2049662.2049663"},{"key":"e_1_3_3_2_7_2","doi-asserted-by":"publisher","unstructured":"E.W. Dijkstra. 1959. A note on two problems in connexion with graphs. Numer. Math. 1 1 (1959) 269\u2013271. 10.1007\/BF01386390","DOI":"10.1007\/BF01386390"},{"key":"e_1_3_3_2_8_2","unstructured":"Jason Furtney. 2015. Scikit-fmm software. https:\/\/github.com\/scikit-fmm\/scikit-fmm\/ Accessed: 2024-12-14."},{"key":"e_1_3_3_2_9_2","doi-asserted-by":"publisher","unstructured":"Philipp Herholz and Marc Alexa. 2018. Factor once: reusing cholesky factorizations on sub-meshes. ACM Trans. Graph. 37 6 Article 230 (Dec. 2018). 10.1145\/3272127.3275107","DOI":"10.1145\/3272127.3275107"},{"key":"e_1_3_3_2_10_2","doi-asserted-by":"publisher","unstructured":"Philipp Herholz Timothy\u00a0A. Davis and Marc Alexa. 2017. Localized solutions of sparse linear systems for geometry processing. ACM Trans. Graph. 36 6 Article 183 (Nov. 2017). 10.1145\/3130800.3130849","DOI":"10.1145\/3130800.3130849"},{"key":"e_1_3_3_2_11_2","doi-asserted-by":"publisher","unstructured":"Won-Ki Jeong and Ross\u00a0T. Whitaker. 2008. A Fast Iterative Method for Eikonal Equations. SIAM Journal on Scientific Computing 30 5 (2008) 2512\u20132534. 10.1137\/060670298","DOI":"10.1137\/060670298"},{"key":"e_1_3_3_2_12_2","doi-asserted-by":"publisher","unstructured":"Joseph S.\u00a0B. Mitchell David\u00a0M. Mount and Christos\u00a0H. Papadimitriou. 1987. The Discrete Geodesic Problem. SIAM J. Comput. 16 4 (1987) 647\u2013668. 10.1137\/0216045","DOI":"10.1137\/0216045"},{"key":"e_1_3_3_2_13_2","doi-asserted-by":"publisher","unstructured":"J\u00a0A Sethian. 1996. A fast marching level set method for monotonically advancing fronts. Proceedings of the National Academy of Sciences 93 4 (1996) 1591\u20131595. 10.1073\/pnas.93.4.1591","DOI":"10.1073\/pnas.93.4.1591"},{"key":"e_1_3_3_2_14_2","doi-asserted-by":"publisher","unstructured":"Vitaly Surazhsky Tatiana Surazhsky Danil Kirsanov Steven\u00a0J. Gortler and Hugues Hoppe. 2005. Fast exact and approximate geodesics on meshes. ACM Trans. Graph. 24 3 (July 2005). 10.1145\/1073204.1073228","DOI":"10.1145\/1073204.1073228"},{"key":"e_1_3_3_2_15_2","doi-asserted-by":"publisher","unstructured":"J.N. Tsitsiklis. 1995. Efficient algorithms for globally optimal trajectories. IEEE Trans. Automat. Control 40 9 (1995) 1528\u20131538. 10.1109\/9.412624","DOI":"10.1109\/9.412624"},{"key":"e_1_3_3_2_16_2","doi-asserted-by":"publisher","unstructured":"Alberto Valero-Gomez Javier\u00a0V. Gomez Santiago Garrido and Luis Moreno. 2013. The Path to Efficiency: Fast Marching Method for Safer More Efficient Mobile Robot Trajectories. IEEE Robotics & Automation Magazine 20 4 (2013) 111\u2013120. 10.1109\/MRA.2013.2248309","DOI":"10.1109\/MRA.2013.2248309"},{"key":"e_1_3_3_2_17_2","doi-asserted-by":"crossref","unstructured":"Hongkai Zhao. 2005. A fast sweeping method for eikonal equations. Mathematics of computation 74 250 (2005) 603\u2013627.","DOI":"10.1090\/S0025-5718-04-01678-3"}],"event":{"name":"GI '25: Graphics Interface 2025","location":"Okanagan BC Canada","acronym":"GI '25"},"container-title":["Proceedings of the 51st Graphics Interface Conference 2025"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3769872.3769901","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T10:15:14Z","timestamp":1775038514000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3769872.3769901"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5,26]]},"references-count":16,"alternative-id":["10.1145\/3769872.3769901","10.1145\/3769872"],"URL":"https:\/\/doi.org\/10.1145\/3769872.3769901","relation":{},"subject":[],"published":{"date-parts":[[2025,5,26]]},"assertion":[{"value":"2026-04-01","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}