{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T05:05:32Z","timestamp":1750309532105,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":3,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,12,2]],"date-time":"2024-12-02T00:00:00Z","timestamp":1733097600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"National Science and Technology Council of Taiwan","award":["111R10286C"],"award-info":[{"award-number":["111R10286C"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,12,3]]},"DOI":"10.1145\/3681756.3697911","type":"proceedings-article","created":{"date-parts":[[2024,12,3]],"date-time":"2024-12-03T07:11:12Z","timestamp":1733209872000},"page":"1-2","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Shortest Path Speed-up Through Binary Image Downsampling"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0005-5552-1625","authenticated-orcid":false,"given":"Chia-Chia","family":"Chen","sequence":"first","affiliation":[{"name":"National Yang-Ming Chiao Tung University, Tainan, Taiwan"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6823-8029","authenticated-orcid":false,"given":"Chi-Han","family":"Peng","sequence":"additional","affiliation":[{"name":"National Yang-Ming Chiao Tung University, Tainan, Taiwan"}]}],"member":"320","published-online":{"date-parts":[[2024,12,2]]},"reference":[{"key":"e_1_3_3_2_2_1","unstructured":"Chia-Chia Chen and Chi-Han Peng. 2024. Topology-Preserving Downsampling of Binary Images. The 18th European Conference on Computer Vision (ECCV) (2024)."},{"key":"e_1_3_3_2_3_1","doi-asserted-by":"crossref","unstructured":"Moritz Hilger Ekkehard K\u00f6hler Rolf M\u00f6hring and Heiko Schilling. 2009. Fast Point-to-Point Shortest Path Computations with Arc-Flags. DIMACS Book 74 (07 2009).","DOI":"10.1090\/dimacs\/074\/03"},{"key":"e_1_3_3_2_4_1","doi-asserted-by":"crossref","unstructured":"Rolf\u00a0H. M\u00f6hring Heiko Schilling Birk Sch\u00fctz Dorothea Wagner and Thomas Willhalm. 2007. Partitioning graphs to speedup Dijkstra\u2019s algorithm. ACM J. Exp. Algorithmics 11 (feb 2007) 29\u00a0pages.","DOI":"10.1145\/1187436.1216585"}],"event":{"name":"SA '24: SIGGRAPH Asia 2024 Posters","sponsor":["SIGGRAPH ACM Special Interest Group on Computer Graphics and Interactive Techniques"],"location":"Tokyo Japan","acronym":"SA '24"},"container-title":["SIGGRAPH Asia 2024 Posters"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3681756.3697911","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3681756.3697911","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T01:18:15Z","timestamp":1750295895000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3681756.3697911"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,2]]},"references-count":3,"alternative-id":["10.1145\/3681756.3697911","10.1145\/3681756"],"URL":"https:\/\/doi.org\/10.1145\/3681756.3697911","relation":{},"subject":[],"published":{"date-parts":[[2024,12,2]]},"assertion":[{"value":"2024-12-02","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}