{"id":"https://openalex.org/W2074537686","doi":"https://doi.org/10.1145/1559755.1559761","title":"Improving Chen and Han's algorithm on the discrete geodesic problem","display_name":"Improving Chen and Han's algorithm on the discrete geodesic problem","publication_year":2009,"publication_date":"2009-08-01","ids":{"openalex":"https://openalex.org/W2074537686","doi":"https://doi.org/10.1145/1559755.1559761","mag":"2074537686"},"language":"en","primary_location":{"id":"doi:10.1145/1559755.1559761","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1559755.1559761","pdf_url":null,"source":{"id":"https://openalex.org/S185367456","display_name":"ACM Transactions on Graphics","issn_l":"0730-0301","issn":["0730-0301","1557-7368"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Graphics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5062030077","display_name":"Shiqing Xin","orcid":"https://orcid.org/0000-0001-8452-8723"},"institutions":[{"id":"https://openalex.org/I76130692","display_name":"Zhejiang University","ror":"https://ror.org/00a2xv884","country_code":"CN","type":"education","lineage":["https://openalex.org/I76130692"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Shi-Qing Xin","raw_affiliation_strings":["Zhejiang University, Hangzhou, PR China","Zhejiang University; Hangzhou, PR China"],"affiliations":[{"raw_affiliation_string":"Zhejiang University, Hangzhou, PR China","institution_ids":["https://openalex.org/I76130692"]},{"raw_affiliation_string":"Zhejiang University; Hangzhou, PR China","institution_ids":["https://openalex.org/I76130692"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5037035536","display_name":"Guojin Wang","orcid":"https://orcid.org/0009-0001-4116-703X"},"institutions":[{"id":"https://openalex.org/I76130692","display_name":"Zhejiang University","ror":"https://ror.org/00a2xv884","country_code":"CN","type":"education","lineage":["https://openalex.org/I76130692"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Guo-Jin Wang","raw_affiliation_strings":["Zhejiang University, Hangzhou, PR China","Zhejiang University; Hangzhou, PR China"],"affiliations":[{"raw_affiliation_string":"Zhejiang University, Hangzhou, PR China","institution_ids":["https://openalex.org/I76130692"]},{"raw_affiliation_string":"Zhejiang University; Hangzhou, PR China","institution_ids":["https://openalex.org/I76130692"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5062030077"],"corresponding_institution_ids":["https://openalex.org/I76130692"],"apc_list":null,"apc_paid":null,"fwci":14.0735,"has_fulltext":false,"cited_by_count":164,"citation_normalized_percentile":{"value":0.98656104,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":100},"biblio":{"volume":"28","issue":"4","first_page":"1","last_page":"8"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9983000159263611,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10719","display_name":"3D Shape Modeling and Analysis","score":0.9961000084877014,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.7732710242271423},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.736655056476593},{"id":"https://openalex.org/keywords/geodesic","display_name":"Geodesic","score":0.5894043445587158},{"id":"https://openalex.org/keywords/priority-queue","display_name":"Priority queue","score":0.5410816073417664},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.501549482345581},{"id":"https://openalex.org/keywords/suurballes-algorithm","display_name":"Suurballe's algorithm","score":0.5007529258728027},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4906686544418335},{"id":"https://openalex.org/keywords/pathfinding","display_name":"Pathfinding","score":0.4875046908855438},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.46758246421813965},{"id":"https://openalex.org/keywords/polyhedron","display_name":"Polyhedron","score":0.4640950560569763},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4377669394016266},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.43285101652145386},{"id":"https://openalex.org/keywords/polygon-mesh","display_name":"Polygon mesh","score":0.4215629994869232},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4086221754550934},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3861936032772064},{"id":"https://openalex.org/keywords/queue","display_name":"Queue","score":0.30343180894851685},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.21514886617660522}],"concepts":[{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.7732710242271423},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.736655056476593},{"id":"https://openalex.org/C165818556","wikidata":"https://www.wikidata.org/wiki/Q213488","display_name":"Geodesic","level":2,"score":0.5894043445587158},{"id":"https://openalex.org/C26951474","wikidata":"https://www.wikidata.org/wiki/Q629283","display_name":"Priority queue","level":3,"score":0.5410816073417664},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.501549482345581},{"id":"https://openalex.org/C98779529","wikidata":"https://www.wikidata.org/wiki/Q7650417","display_name":"Suurballe's algorithm","level":5,"score":0.5007529258728027},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4906686544418335},{"id":"https://openalex.org/C25321074","wikidata":"https://www.wikidata.org/wiki/Q1969601","display_name":"Pathfinding","level":4,"score":0.4875046908855438},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.46758246421813965},{"id":"https://openalex.org/C54829058","wikidata":"https://www.wikidata.org/wiki/Q172937","display_name":"Polyhedron","level":2,"score":0.4640950560569763},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4377669394016266},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.43285101652145386},{"id":"https://openalex.org/C31487907","wikidata":"https://www.wikidata.org/wiki/Q1154597","display_name":"Polygon mesh","level":2,"score":0.4215629994869232},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4086221754550934},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3861936032772064},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.30343180894851685},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.21514886617660522},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/1559755.1559761","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1559755.1559761","pdf_url":null,"source":{"id":"https://openalex.org/S185367456","display_name":"ACM Transactions on Graphics","issn_l":"0730-0301","issn":["0730-0301","1557-7368"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Graphics","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.163.3650","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.163.3650","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.math.zju.edu.cn/cagd/Publications/2009_TOG_XinShiqing.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G5132236447","display_name":null,"funder_award_id":"60873111","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"},{"id":"https://openalex.org/G6183086266","display_name":null,"funder_award_id":"2004CB719400","funder_id":"https://openalex.org/F4320321540","funder_display_name":"Ministry of Science and Technology of the People's Republic of China"}],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"},{"id":"https://openalex.org/F4320321540","display_name":"Ministry of Science and Technology of the People's Republic of China","ror":"https://ror.org/027s68j25"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W1014505","https://openalex.org/W160600641","https://openalex.org/W1509553329","https://openalex.org/W1512906775","https://openalex.org/W1559701472","https://openalex.org/W1679085596","https://openalex.org/W1906263998","https://openalex.org/W1912799504","https://openalex.org/W1993264991","https://openalex.org/W1999690352","https://openalex.org/W2009056209","https://openalex.org/W2012669981","https://openalex.org/W2021587133","https://openalex.org/W2042746037","https://openalex.org/W2049480565","https://openalex.org/W2054113582","https://openalex.org/W2063071084","https://openalex.org/W2072410861","https://openalex.org/W2075927382","https://openalex.org/W2081132240","https://openalex.org/W2081777693","https://openalex.org/W2108567935","https://openalex.org/W2114121462","https://openalex.org/W2129612824","https://openalex.org/W2131911297","https://openalex.org/W2132457975","https://openalex.org/W2134921160","https://openalex.org/W2136150520","https://openalex.org/W2143118902","https://openalex.org/W2161253909","https://openalex.org/W2169528473"],"related_works":["https://openalex.org/W3015233512","https://openalex.org/W4383900343","https://openalex.org/W2514247065","https://openalex.org/W3216780016","https://openalex.org/W3124075993","https://openalex.org/W4281943708","https://openalex.org/W2386991836","https://openalex.org/W2385737134","https://openalex.org/W2359464676","https://openalex.org/W2075800961"],"abstract_inverted_index":{"The":[0,104],"computation":[1],"of":[2,61,110,113,119,124,136,145,177,208],"geodesic":[3],"distances":[4,179],"or":[5],"paths":[6,115],"between":[7],"two":[8,163],"points":[9],"on":[10,53,121],"triangulated":[11],"meshes":[12],"is":[13,58,167,185],"a":[14,117,150,188],"common":[15],"operation":[16],"in":[17,98,131,194,206,226],"many":[18,95,132],"computer":[19],"graphics":[20],"applications.":[21],"In":[22],"this":[23,154],"article,":[24],"we":[25],"present":[26],"an":[27,42,209],"exact":[28],"algorithm":[29,93,106,143,161,225,239],"for":[30],"the":[31,59,62,72,91,101,108,111,122,125,137,141,159,174,178,181,183,202,222,237],"single-source":[32],"all-vertices":[33],"shortest":[34,114,151],"path":[35],"problem.":[36],"Mitchell":[37],"et":[38,83],"al.":[39,84],"[1987]":[40],"proposed":[41],"O":[43,76,210],"(":[44,77,211],"n":[45,48,57,78,212,215],"2":[46,79,213],"log":[47,214],")":[49,216],"method":[50],"(MMP),":[51],"based":[52],"Dijkstra's":[54,195],"algorithm,":[55,205],"where":[56],"complexity":[60],"polyhedral":[63],"surface.":[64],"Then,":[65],"Chen":[66],"and":[67,229,240],"Han":[68],"[1990]":[69],"(CH)":[70],"improved":[71,203],"running":[73],"time":[74,218,228],"to":[75,148,157,168,180,186],").":[80],"Interestingly":[81],"Surazhsky":[82],"[2005]":[85],"provided":[86],"experimental":[87,198],"evidence":[88],"demonstrating":[89],"that":[90,130,192,201],"MMP":[92,238],"runs":[94,234],"times":[96],"faster,":[97],"practice,":[99],"than":[100,236],"CH":[102,105,142,160,204,224],"algorithm.":[103,196],"encodes":[107],"structure":[109],"set":[112,118],"using":[116,173],"windows":[120,138,172],"edges":[123],"polyhedron.":[126],"Our":[127,197],"experiments":[128],"showed":[129],"examples":[133],"over":[134],"99%":[135],"created":[139],"by":[140,162],"are":[144],"no":[146],"use":[147],"define":[149],"path.":[152],"So":[153],"article":[155],"proposes":[156],"improve":[158],"separate":[164],"techniques.":[165],"One":[166],"filter":[169],"out":[170],"useless":[171],"current":[175],"estimates":[176],"vertices,":[182],"other":[184],"maintain":[187],"priority":[189],"queue":[190],"like":[191],"achieved":[193],"results":[199],"suggest":[200],"spite":[207],"asymptotic":[217],"complexity,":[219],"greatly":[220],"outperforms":[221],"original":[223],"both":[227],"space.":[230,244],"Furthermore,":[231],"it":[232],"generally":[233],"faster":[235],"uses":[241],"considerably":[242],"less":[243]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":7},{"year":2024,"cited_by_count":7},{"year":2023,"cited_by_count":16},{"year":2022,"cited_by_count":7},{"year":2021,"cited_by_count":20},{"year":2020,"cited_by_count":11},{"year":2019,"cited_by_count":12},{"year":2018,"cited_by_count":10},{"year":2017,"cited_by_count":11},{"year":2016,"cited_by_count":9},{"year":2015,"cited_by_count":10},{"year":2014,"cited_by_count":11},{"year":2013,"cited_by_count":10},{"year":2012,"cited_by_count":9}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}