{"id":"https://openalex.org/W2081253227","doi":"https://doi.org/10.1145/1653771.1653804","title":"Reducing the memory required to find a geodesic shortest path on a large mesh","display_name":"Reducing the memory required to find a geodesic shortest path on a large mesh","publication_year":2009,"publication_date":"2009-11-04","ids":{"openalex":"https://openalex.org/W2081253227","doi":"https://doi.org/10.1145/1653771.1653804","mag":"2081253227"},"language":"en","primary_location":{"id":"doi:10.1145/1653771.1653804","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1653771.1653804","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems","raw_type":"proceedings-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/A5102008357","display_name":"Vishal Verma","orcid":"https://orcid.org/0000-0002-7442-4215"},"institutions":[{"id":"https://openalex.org/I114027177","display_name":"University of North Carolina at Chapel Hill","ror":"https://ror.org/0130frc33","country_code":"US","type":"education","lineage":["https://openalex.org/I114027177"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Vishal Verma","raw_affiliation_strings":["University of North Carolina at Chapel Hill"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of North Carolina at Chapel Hill","institution_ids":["https://openalex.org/I114027177"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5074061303","display_name":"Jack Snoeyink","orcid":"https://orcid.org/0000-0002-3887-4008"},"institutions":[{"id":"https://openalex.org/I114027177","display_name":"University of North Carolina at Chapel Hill","ror":"https://ror.org/0130frc33","country_code":"US","type":"education","lineage":["https://openalex.org/I114027177"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jack Snoeyink","raw_affiliation_strings":["University of North Carolina at Chapel Hill"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of North Carolina at Chapel Hill","institution_ids":["https://openalex.org/I114027177"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.7859,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.84043187,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"227","last_page":"235"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9994999766349792,"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"}},"topics":[{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9994999766349792,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9990000128746033,"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9805999994277954,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/bottleneck","display_name":"Bottleneck","score":0.8650810122489929},{"id":"https://openalex.org/keywords/polygon-mesh","display_name":"Polygon mesh","score":0.7469891905784607},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7272621393203735},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.7234995365142822},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.6499985456466675},{"id":"https://openalex.org/keywords/terrain","display_name":"Terrain","score":0.6348221302032471},{"id":"https://openalex.org/keywords/geodesic","display_name":"Geodesic","score":0.6030338406562805},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5652066469192505},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.48239362239837646},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37431642413139343},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.3464175760746002},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.34174251556396484},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.28693723678588867},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.18167105317115784},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1812426745891571},{"id":"https://openalex.org/keywords/computer-graphics","display_name":"Computer graphics (images)","score":0.10703575611114502},{"id":"https://openalex.org/keywords/embedded-system","display_name":"Embedded system","score":0.0918213427066803},{"id":"https://openalex.org/keywords/geography","display_name":"Geography","score":0.0829077959060669},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.06333887577056885}],"concepts":[{"id":"https://openalex.org/C2780513914","wikidata":"https://www.wikidata.org/wiki/Q18210350","display_name":"Bottleneck","level":2,"score":0.8650810122489929},{"id":"https://openalex.org/C31487907","wikidata":"https://www.wikidata.org/wiki/Q1154597","display_name":"Polygon mesh","level":2,"score":0.7469891905784607},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7272621393203735},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7234995365142822},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.6499985456466675},{"id":"https://openalex.org/C161840515","wikidata":"https://www.wikidata.org/wiki/Q186131","display_name":"Terrain","level":2,"score":0.6348221302032471},{"id":"https://openalex.org/C165818556","wikidata":"https://www.wikidata.org/wiki/Q213488","display_name":"Geodesic","level":2,"score":0.6030338406562805},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5652066469192505},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.48239362239837646},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37431642413139343},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.3464175760746002},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.34174251556396484},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.28693723678588867},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.18167105317115784},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1812426745891571},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.10703575611114502},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.0918213427066803},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0829077959060669},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.06333887577056885},{"id":"https://openalex.org/C58640448","wikidata":"https://www.wikidata.org/wiki/Q42515","display_name":"Cartography","level":1,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","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":1,"locations":[{"id":"doi:10.1145/1653771.1653804","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1653771.1653804","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3413739455","display_name":null,"funder_award_id":"HM1582-05-2-0003","funder_id":"https://openalex.org/F4320332165","funder_display_name":"National Geospatial-Intelligence Agency"},{"id":"https://openalex.org/G7960501027","display_name":null,"funder_award_id":"HM1582-05-2-0003","funder_id":"https://openalex.org/F4320332180","funder_display_name":"Defense Advanced Research Projects Agency"}],"funders":[{"id":"https://openalex.org/F4320332165","display_name":"National Geospatial-Intelligence Agency","ror":"https://ror.org/02k4pxv54"},{"id":"https://openalex.org/F4320332180","display_name":"Defense Advanced Research Projects Agency","ror":"https://ror.org/02caytj08"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W1540751326","https://openalex.org/W1559384720","https://openalex.org/W1559701472","https://openalex.org/W1607062769","https://openalex.org/W1778234905","https://openalex.org/W1810931192","https://openalex.org/W1969483458","https://openalex.org/W1979750070","https://openalex.org/W1988714784","https://openalex.org/W1993116490","https://openalex.org/W1999690352","https://openalex.org/W2021587133","https://openalex.org/W2024633610","https://openalex.org/W2038142281","https://openalex.org/W2044089388","https://openalex.org/W2050590009","https://openalex.org/W2083801185","https://openalex.org/W2108567935","https://openalex.org/W2125867579","https://openalex.org/W2151400766","https://openalex.org/W2159656051","https://openalex.org/W2161253909","https://openalex.org/W2169528473","https://openalex.org/W2294163059","https://openalex.org/W2969198288","https://openalex.org/W4244850198","https://openalex.org/W6697031768"],"related_works":["https://openalex.org/W2198982833","https://openalex.org/W2767202586","https://openalex.org/W4293054712","https://openalex.org/W2375775343","https://openalex.org/W2388654557","https://openalex.org/W2360981904","https://openalex.org/W2365712669","https://openalex.org/W2161960576","https://openalex.org/W1990043277","https://openalex.org/W2349797546"],"abstract_inverted_index":{"Finding":[0],"shortest":[1],"paths":[2],"and":[3],"distances":[4],"on":[5],"the":[6,37,42],"surface":[7],"of":[8],"a":[9,14],"mesh":[10],"in":[11,35],"R3":[12],"is":[13,40],"well":[15],"studied":[16],"problem,":[17],"with":[18],"most":[19],"research":[20],"aiming":[21],"to":[22],"minimize":[23],"computation":[24],"time.":[25],"However":[26],"for":[27],"large":[28],"meshes,":[29],"such":[30],"as":[31],"TIN":[32],"terrain":[33],"models":[34],"GIS,":[36],"major":[38],"bottleneck":[39],"often":[41],"memory":[43],"required":[44],"by":[45],"an":[46],"algorithm.":[47]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}