{"id":"https://openalex.org/W1932623398","doi":"https://doi.org/10.1007/3-540-52846-6_91","title":"Finding shortest paths in the presence of orthogonal obstacles using a combined L 1 and link metric","display_name":"Finding shortest paths in the presence of orthogonal obstacles using a combined L 1 and link metric","publication_year":1990,"publication_date":"1990-01-01","ids":{"openalex":"https://openalex.org/W1932623398","doi":"https://doi.org/10.1007/3-540-52846-6_91","mag":"1932623398"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-52846-6_91","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-52846-6_91","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://research.tue.nl/nl/publications/02eda6a0-cb90-476b-8095-15120e85747b","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5044230325","display_name":"Mark T. Berg","orcid":"https://orcid.org/0000-0003-2709-0950"},"institutions":[{"id":"https://openalex.org/I193662353","display_name":"Utrecht University","ror":"https://ror.org/04pp8hn57","country_code":"NL","type":"education","lineage":["https://openalex.org/I193662353"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Mark Berg","raw_affiliation_strings":["Utrecht university >  >  >  >"],"affiliations":[{"raw_affiliation_string":"Utrecht university >  >  >  >","institution_ids":["https://openalex.org/I193662353"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5053874521","display_name":"Marc van Kreveld","orcid":"https://orcid.org/0000-0001-8208-3468"},"institutions":[{"id":"https://openalex.org/I193662353","display_name":"Utrecht University","ror":"https://ror.org/04pp8hn57","country_code":"NL","type":"education","lineage":["https://openalex.org/I193662353"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Marc Kreveld","raw_affiliation_strings":["Utrecht university >  >  >  >"],"affiliations":[{"raw_affiliation_string":"Utrecht university >  >  >  >","institution_ids":["https://openalex.org/I193662353"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101713320","display_name":"Bengt J. Nilsson","orcid":"https://orcid.org/0000-0002-1342-8618"},"institutions":[{"id":"https://openalex.org/I187531555","display_name":"Lund University","ror":"https://ror.org/012a77v79","country_code":"SE","type":"education","lineage":["https://openalex.org/I187531555"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Bengt J. Nilsson","raw_affiliation_strings":["Department of Computer Science, Lund University, Box 118, 221 00, Lund, Sweden","Lund Univ.#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Lund University, Box 118, 221 00, Lund, Sweden","institution_ids":["https://openalex.org/I187531555"]},{"raw_affiliation_string":"Lund Univ.#TAB#","institution_ids":["https://openalex.org/I187531555"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5109216741","display_name":"Mark H. Overmars","orcid":null},"institutions":[{"id":"https://openalex.org/I193662353","display_name":"Utrecht University","ror":"https://ror.org/04pp8hn57","country_code":"NL","type":"education","lineage":["https://openalex.org/I193662353"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Mark H. Overmars","raw_affiliation_strings":["Department of Computer Science, Utrecht University, P.O.Box 80.089, 3508 TB, Utrecht, the Netherlands","Utrecht university >  >  >  >"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Utrecht University, P.O.Box 80.089, 3508 TB, Utrecht, the Netherlands","institution_ids":["https://openalex.org/I193662353"]},{"raw_affiliation_string":"Utrecht university >  >  >  >","institution_ids":["https://openalex.org/I193662353"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5044230325"],"corresponding_institution_ids":["https://openalex.org/I193662353"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":2.8839,"has_fulltext":false,"cited_by_count":24,"citation_normalized_percentile":{"value":0.91891892,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"213","last_page":"224"},"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.9994000196456909,"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.9994000196456909,"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.9986000061035156,"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.9973999857902527,"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/shortest-path-problem","display_name":"Shortest path problem","score":0.8073213696479797},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.6819415092468262},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5551611185073853},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5518261194229126},{"id":"https://openalex.org/keywords/link","display_name":"Link (geometry)","score":0.4994497299194336},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.4944572448730469},{"id":"https://openalex.org/keywords/metric-space","display_name":"Metric space","score":0.4762822985649109},{"id":"https://openalex.org/keywords/euclidean-shortest-path","display_name":"Euclidean shortest path","score":0.46234431862831116},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.45705342292785645},{"id":"https://openalex.org/keywords/obstacle","display_name":"Obstacle","score":0.4552837610244751},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.45504724979400635},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.4391915202140808},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.4332406520843506},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3750370144844055},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.37476611137390137},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.36096078157424927},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.32999154925346375},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.08093845844268799},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.06366869807243347}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.8073213696479797},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.6819415092468262},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5551611185073853},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5518261194229126},{"id":"https://openalex.org/C2778753846","wikidata":"https://www.wikidata.org/wiki/Q6554239","display_name":"Link (geometry)","level":2,"score":0.4994497299194336},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.4944572448730469},{"id":"https://openalex.org/C198043062","wikidata":"https://www.wikidata.org/wiki/Q180953","display_name":"Metric space","level":2,"score":0.4762822985649109},{"id":"https://openalex.org/C170836113","wikidata":"https://www.wikidata.org/wiki/Q5406126","display_name":"Euclidean shortest path","level":5,"score":0.46234431862831116},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.45705342292785645},{"id":"https://openalex.org/C2776650193","wikidata":"https://www.wikidata.org/wiki/Q264661","display_name":"Obstacle","level":2,"score":0.4552837610244751},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.45504724979400635},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.4391915202140808},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.4332406520843506},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3750370144844055},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.37476611137390137},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.36096078157424927},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.32999154925346375},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.08093845844268799},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.06366869807243347},{"id":"https://openalex.org/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","level":1,"score":0.0},{"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/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":7,"locations":[{"id":"doi:10.1007/3-540-52846-6_91","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-52846-6_91","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:pure.tue.nl:openaire_cris_publications/915bf612-af37-47e5-a6e7-120d5e13f11f","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/915bf612-af37-47e5-a6e7-120d5e13f11f","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Berg, de, M, Kreveld, van, M J, Nilsson, B J & Overmars, M H 1990, Finding shortest paths in the presence of orthogonal obstacles using a combined $L_1$ and link metric. in J R Gilbert & R G Karlsson (eds), SWAT 90 (Proceedings of the 2nd Scandinavian Workshop on Algorithm Theory, Bergen, Norway, July 11-14, 1990). Lecture Notes in Computer Science, vol. 447, Springer, Berlin, pp. 213-224. https://doi.org/10.1007/3-540-52846-6_91","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:tue:oai:pure.tue.nl:publications/02eda6a0-cb90-476b-8095-15120e85747b","is_oa":true,"landing_page_url":"https://research.tue.nl/nl/publications/02eda6a0-cb90-476b-8095-15120e85747b","pdf_url":"https://research.tue.nl/nl/publications/02eda6a0-cb90-476b-8095-15120e85747b","source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/report"},{"id":"pmh:oai:pure.tue.nl:publications/02eda6a0-cb90-476b-8095-15120e85747b","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/02eda6a0-cb90-476b-8095-15120e85747b","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""},{"id":"pmh:tue:oai:library.tue.nl:370644","is_oa":false,"landing_page_url":"http://repository.tue.nl/370644","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/report"},{"id":"pmh:tue:oai:pure.tue.nl:publications/915bf612-af37-47e5-a6e7-120d5e13f11f","is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/915bf612-af37-47e5-a6e7-120d5e13f11f","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SWAT 90 (Proceedings of the 2nd Scandinavian Workshop on Algorithm Theory, Bergen, Norway, July 11-14, 1990), 213 - 224","raw_type":"info:eu-repo/semantics/conferencepaper"},{"id":"pmh:uu:oai:dspace.library.uu.nl:1874/16632","is_oa":true,"landing_page_url":"https://dspace.library.uu.nl/handle/1874/16632","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/other"}],"best_oa_location":{"id":"pmh:tue:oai:pure.tue.nl:publications/02eda6a0-cb90-476b-8095-15120e85747b","is_oa":true,"landing_page_url":"https://research.tue.nl/nl/publications/02eda6a0-cb90-476b-8095-15120e85747b","pdf_url":"https://research.tue.nl/nl/publications/02eda6a0-cb90-476b-8095-15120e85747b","source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/report"},"sustainable_development_goals":[{"score":0.41999998688697815,"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1932623398.pdf"},"referenced_works_count":20,"referenced_works":["https://openalex.org/W628736642","https://openalex.org/W1509231325","https://openalex.org/W1549431641","https://openalex.org/W1979832172","https://openalex.org/W1990613315","https://openalex.org/W1992320342","https://openalex.org/W1997308325","https://openalex.org/W2001876175","https://openalex.org/W2019176509","https://openalex.org/W2029814178","https://openalex.org/W2032159439","https://openalex.org/W2035007760","https://openalex.org/W2062367161","https://openalex.org/W2081777693","https://openalex.org/W2163178194","https://openalex.org/W2169528473","https://openalex.org/W2807850676","https://openalex.org/W3148691794","https://openalex.org/W4206498342","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2360981904","https://openalex.org/W2562562750","https://openalex.org/W4223969905","https://openalex.org/W2347245430","https://openalex.org/W2377950158","https://openalex.org/W3088868185","https://openalex.org/W2379804627","https://openalex.org/W2112429204","https://openalex.org/W2170980056","https://openalex.org/W2363342665"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-04T08:04:53.788161","created_date":"2025-10-10T00:00:00"}