{"id":"https://openalex.org/W2099686509","doi":"https://doi.org/10.1007/978-3-642-02158-9_13","title":"Link Distance and Shortest Path Problems in the Plane","display_name":"Link Distance and Shortest Path Problems in the Plane","publication_year":2009,"publication_date":"2009-01-01","ids":{"openalex":"https://openalex.org/W2099686509","doi":"https://doi.org/10.1007/978-3-642-02158-9_13","mag":"2099686509"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-02158-9_13","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-02158-9_13","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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5068552959","display_name":"Atlas F. Cook","orcid":null},"institutions":[{"id":"https://openalex.org/I45438204","display_name":"The University of Texas at San Antonio","ror":"https://ror.org/01kd65564","country_code":"US","type":"education","lineage":["https://openalex.org/I45438204"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Atlas F. Cook","raw_affiliation_strings":["Department of Computer Science, University of Texas at San Antonio, One UTSA Circle, San Antonio, TX 78249-0667, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Texas at San Antonio, One UTSA Circle, San Antonio, TX 78249-0667, USA","institution_ids":["https://openalex.org/I45438204"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5054903605","display_name":"Carola Wenk","orcid":"https://orcid.org/0000-0001-9275-5336"},"institutions":[{"id":"https://openalex.org/I45438204","display_name":"The University of Texas at San Antonio","ror":"https://ror.org/01kd65564","country_code":"US","type":"education","lineage":["https://openalex.org/I45438204"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Carola Wenk","raw_affiliation_strings":["Department of Computer Science, University of Texas at San Antonio, One UTSA Circle, San Antonio, TX 78249-0667, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Texas at San Antonio, One UTSA Circle, San Antonio, TX 78249-0667, USA","institution_ids":["https://openalex.org/I45438204"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5068552959"],"corresponding_institution_ids":["https://openalex.org/I45438204"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.4437,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.81270358,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"140","last_page":"151"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":1.0,"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":1.0,"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.9991999864578247,"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/T12923","display_name":"Digital Image Processing Techniques","score":0.9962999820709229,"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/voronoi-diagram","display_name":"Voronoi diagram","score":0.8961963653564453},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.8543460369110107},{"id":"https://openalex.org/keywords/euclidean-shortest-path","display_name":"Euclidean shortest path","score":0.7033311724662781},{"id":"https://openalex.org/keywords/euclidean-distance","display_name":"Euclidean distance","score":0.6716171503067017},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6108173727989197},{"id":"https://openalex.org/keywords/weighted-voronoi-diagram","display_name":"Weighted Voronoi diagram","score":0.6102200746536255},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.596280038356781},{"id":"https://openalex.org/keywords/plane","display_name":"Plane (geometry)","score":0.5851282477378845},{"id":"https://openalex.org/keywords/distance","display_name":"Distance","score":0.5716122388839722},{"id":"https://openalex.org/keywords/link","display_name":"Link (geometry)","score":0.47432631254196167},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.47148582339286804},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.43149715662002563},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.4171704053878784},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.41539159417152405},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.382510781288147},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.3684529662132263},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.31396961212158203},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2921941876411438},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2266589105129242},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.19812491536140442},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.163068950176239},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.07137352228164673},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.06720483303070068}],"concepts":[{"id":"https://openalex.org/C24881265","wikidata":"https://www.wikidata.org/wiki/Q757267","display_name":"Voronoi diagram","level":2,"score":0.8961963653564453},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.8543460369110107},{"id":"https://openalex.org/C170836113","wikidata":"https://www.wikidata.org/wiki/Q5406126","display_name":"Euclidean shortest path","level":5,"score":0.7033311724662781},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.6716171503067017},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6108173727989197},{"id":"https://openalex.org/C20468658","wikidata":"https://www.wikidata.org/wiki/Q17130624","display_name":"Weighted Voronoi diagram","level":3,"score":0.6102200746536255},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.596280038356781},{"id":"https://openalex.org/C17825722","wikidata":"https://www.wikidata.org/wiki/Q17285","display_name":"Plane (geometry)","level":2,"score":0.5851282477378845},{"id":"https://openalex.org/C54385418","wikidata":"https://www.wikidata.org/wiki/Q2742711","display_name":"Distance","level":4,"score":0.5716122388839722},{"id":"https://openalex.org/C2778753846","wikidata":"https://www.wikidata.org/wiki/Q6554239","display_name":"Link (geometry)","level":2,"score":0.47432631254196167},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.47148582339286804},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.43149715662002563},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.4171704053878784},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.41539159417152405},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.382510781288147},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.3684529662132263},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.31396961212158203},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2921941876411438},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2266589105129242},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.19812491536140442},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.163068950176239},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.07137352228164673},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.06720483303070068}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/978-3-642-02158-9_13","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-02158-9_13","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/2b9a19c2-7a25-4dcd-bf63-7dcc0012f382","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/2b9a19c2-7a25-4dcd-bf63-7dcc0012f382","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":"Cook IV, A F & Wenk, C 2009, Link distance and shortest path problems in the plane. in A V Goldberg & Y Zhou (eds), Algorithmic aspects in information and management : 5th international conference on algorithmic aspects in information and management (AAIM 2009), 15-17 June 2009 : proceedings. Lecture Notes in Computer Science, vol. 5564, Springer, Berlin, pp. 141-151. https://doi.org/10.1007/978-3-642-02158-9_13","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:tue:oai:pure.tue.nl:publications/2b9a19c2-7a25-4dcd-bf63-7dcc0012f382","is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/2b9a19c2-7a25-4dcd-bf63-7dcc0012f382","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":"Algorithmic aspects in information and management : 5th international conference on algorithmic aspects in information and management (AAIM 2009), 15-17 June 2009 : proceedings, 141 - 151","raw_type":"info:eu-repo/semantics/conferencepaper"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W114049493","https://openalex.org/W1559701472","https://openalex.org/W2001513095","https://openalex.org/W2021746803","https://openalex.org/W2028747718","https://openalex.org/W2031247977","https://openalex.org/W2035007760","https://openalex.org/W2058510050","https://openalex.org/W2077159475","https://openalex.org/W2113946784","https://openalex.org/W2124299914","https://openalex.org/W2132339863","https://openalex.org/W2138069944","https://openalex.org/W2152616797","https://openalex.org/W2486666919","https://openalex.org/W2762935521","https://openalex.org/W2952397824"],"related_works":["https://openalex.org/W2347245430","https://openalex.org/W4293054712","https://openalex.org/W2167427782","https://openalex.org/W651485002","https://openalex.org/W2018146256","https://openalex.org/W2375775343","https://openalex.org/W2237480599","https://openalex.org/W1504745067","https://openalex.org/W2198982833","https://openalex.org/W2950984363"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}