{"id":"https://openalex.org/W2025130628","doi":"https://doi.org/10.1007/s00453-001-0027-5","title":"Approximating Shortest Paths on Weighted Polyhedral Surfaces","display_name":"Approximating Shortest Paths on Weighted Polyhedral Surfaces","publication_year":2001,"publication_date":"2001-01-01","ids":{"openalex":"https://openalex.org/W2025130628","doi":"https://doi.org/10.1007/s00453-001-0027-5","mag":"2025130628"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-001-0027-5","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-001-0027-5","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","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/A5078163620","display_name":"Mark Lanthier","orcid":null},"institutions":[{"id":"https://openalex.org/I67031392","display_name":"Carleton University","ror":"https://ror.org/02qtvee93","country_code":"CA","type":"education","lineage":["https://openalex.org/I67031392"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"M. Lanthier","raw_affiliation_strings":["School of Computer Science,  Carleton University,  1125 Colonel By Drive,  Ottawa, Ontario, Canada K1S 5B6.  \\{lanthier,maheshwa,sack\\}@scs.carleton.ca., , , , , , CA","School of Computer Science,  Carleton University,  1125 Colonel By Drive,  Ottawa, Ontario, Canada K1S 5B6.  \\\\{lanthier,maheshwa,sack\\\\}@scs.carleton.ca., , CA"],"affiliations":[{"raw_affiliation_string":"School of Computer Science,  Carleton University,  1125 Colonel By Drive,  Ottawa, Ontario, Canada K1S 5B6.  \\{lanthier,maheshwa,sack\\}@scs.carleton.ca., , , , , , CA","institution_ids":["https://openalex.org/I67031392"]},{"raw_affiliation_string":"School of Computer Science,  Carleton University,  1125 Colonel By Drive,  Ottawa, Ontario, Canada K1S 5B6.  \\\\{lanthier,maheshwa,sack\\\\}@scs.carleton.ca., , CA","institution_ids":["https://openalex.org/I67031392"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103136561","display_name":"Anil Maheshwari","orcid":"https://orcid.org/0000-0002-1274-4598"},"institutions":[{"id":"https://openalex.org/I67031392","display_name":"Carleton University","ror":"https://ror.org/02qtvee93","country_code":"CA","type":"education","lineage":["https://openalex.org/I67031392"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"A. Maheshwari","raw_affiliation_strings":["School of Computer Science,  Carleton University,  1125 Colonel By Drive,  Ottawa, Ontario, Canada K1S 5B6.  \\{lanthier,maheshwa,sack\\}@scs.carleton.ca., , , , , , CA","School of Computer Science,  Carleton University,  1125 Colonel By Drive,  Ottawa, Ontario, Canada K1S 5B6.  \\\\{lanthier,maheshwa,sack\\\\}@scs.carleton.ca., , CA"],"affiliations":[{"raw_affiliation_string":"School of Computer Science,  Carleton University,  1125 Colonel By Drive,  Ottawa, Ontario, Canada K1S 5B6.  \\{lanthier,maheshwa,sack\\}@scs.carleton.ca., , , , , , CA","institution_ids":["https://openalex.org/I67031392"]},{"raw_affiliation_string":"School of Computer Science,  Carleton University,  1125 Colonel By Drive,  Ottawa, Ontario, Canada K1S 5B6.  \\\\{lanthier,maheshwa,sack\\\\}@scs.carleton.ca., , CA","institution_ids":["https://openalex.org/I67031392"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5085978384","display_name":"J\u00f6rg-R\u00fcdiger Sack","orcid":"https://orcid.org/0000-0001-5936-1319"},"institutions":[{"id":"https://openalex.org/I67031392","display_name":"Carleton University","ror":"https://ror.org/02qtvee93","country_code":"CA","type":"education","lineage":["https://openalex.org/I67031392"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"J. -R. Sack","raw_affiliation_strings":["School of Computer Science,  Carleton University,  1125 Colonel By Drive,  Ottawa, Ontario, Canada K1S 5B6.  \\{lanthier,maheshwa,sack\\}@scs.carleton.ca., , , , , , CA","School of Computer Science,  Carleton University,  1125 Colonel By Drive,  Ottawa, Ontario, Canada K1S 5B6.  \\\\{lanthier,maheshwa,sack\\\\}@scs.carleton.ca., , CA"],"affiliations":[{"raw_affiliation_string":"School of Computer Science,  Carleton University,  1125 Colonel By Drive,  Ottawa, Ontario, Canada K1S 5B6.  \\{lanthier,maheshwa,sack\\}@scs.carleton.ca., , , , , , CA","institution_ids":["https://openalex.org/I67031392"]},{"raw_affiliation_string":"School of Computer Science,  Carleton University,  1125 Colonel By Drive,  Ottawa, Ontario, Canada K1S 5B6.  \\\\{lanthier,maheshwa,sack\\\\}@scs.carleton.ca., , CA","institution_ids":["https://openalex.org/I67031392"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5078163620"],"corresponding_institution_ids":["https://openalex.org/I67031392"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":1.8224,"has_fulltext":false,"cited_by_count":67,"citation_normalized_percentile":{"value":0.86896552,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"30","issue":"4","first_page":"527","last_page":"562"},"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.9984999895095825,"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9940999746322632,"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/polyhedron","display_name":"Polyhedron","score":0.7515988349914551},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6977004408836365},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5911388397216797},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.5472280383110046},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5418409109115601},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.5314843654632568},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.4771021008491516},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.4519774615764618},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.4497796595096588},{"id":"https://openalex.org/keywords/domain","display_name":"Domain (mathematical analysis)","score":0.4390045702457428},{"id":"https://openalex.org/keywords/euclidean-shortest-path","display_name":"Euclidean shortest path","score":0.4300365447998047},{"id":"https://openalex.org/keywords/computational-geometry","display_name":"Computational geometry","score":0.42548656463623047},{"id":"https://openalex.org/keywords/face","display_name":"Face (sociological concept)","score":0.4135099947452545},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3498845100402832},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.3473702073097229},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.32517367601394653},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3246147632598877},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.12154883146286011}],"concepts":[{"id":"https://openalex.org/C54829058","wikidata":"https://www.wikidata.org/wiki/Q172937","display_name":"Polyhedron","level":2,"score":0.7515988349914551},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6977004408836365},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5911388397216797},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.5472280383110046},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5418409109115601},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.5314843654632568},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4771021008491516},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.4519774615764618},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.4497796595096588},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.4390045702457428},{"id":"https://openalex.org/C170836113","wikidata":"https://www.wikidata.org/wiki/Q5406126","display_name":"Euclidean shortest path","level":5,"score":0.4300365447998047},{"id":"https://openalex.org/C29123130","wikidata":"https://www.wikidata.org/wiki/Q874709","display_name":"Computational geometry","level":2,"score":0.42548656463623047},{"id":"https://openalex.org/C2779304628","wikidata":"https://www.wikidata.org/wiki/Q3503480","display_name":"Face (sociological concept)","level":2,"score":0.4135099947452545},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3498845100402832},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.3473702073097229},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.32517367601394653},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3246147632598877},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.12154883146286011},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0},{"id":"https://openalex.org/C144024400","wikidata":"https://www.wikidata.org/wiki/Q21201","display_name":"Sociology","level":0,"score":0.0},{"id":"https://openalex.org/C36289849","wikidata":"https://www.wikidata.org/wiki/Q34749","display_name":"Social science","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s00453-001-0027-5","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-001-0027-5","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.6.8923","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.6.8923","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.scs.carleton.ca/~lanthier/personal/cv/algorithmica.ps","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W111486705","https://openalex.org/W240977677","https://openalex.org/W1480698831","https://openalex.org/W1530431002","https://openalex.org/W1969483458","https://openalex.org/W1989723858","https://openalex.org/W1993264991","https://openalex.org/W2006889851","https://openalex.org/W2024693023","https://openalex.org/W2032159439","https://openalex.org/W2036114412","https://openalex.org/W2053723042","https://openalex.org/W2068376033","https://openalex.org/W2072019354","https://openalex.org/W2081777693","https://openalex.org/W2084224084","https://openalex.org/W2087027878","https://openalex.org/W2108567935","https://openalex.org/W2126876121","https://openalex.org/W2169528473","https://openalex.org/W2170220350","https://openalex.org/W2171665075","https://openalex.org/W2969198288"],"related_works":["https://openalex.org/W2381419702","https://openalex.org/W2170980056","https://openalex.org/W2363342665","https://openalex.org/W1562631103","https://openalex.org/W4253588386","https://openalex.org/W2810620529","https://openalex.org/W2734981231","https://openalex.org/W2009539722","https://openalex.org/W1979957675","https://openalex.org/W1994777125"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":4},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":2},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}