{"id":"https://openalex.org/W2151530724","doi":"https://doi.org/10.1007/978-3-642-03367-4_14","title":"Shortest Path Problems on a Polyhedral Surface","display_name":"Shortest Path Problems on a Polyhedral Surface","publication_year":2009,"publication_date":"2009-01-01","ids":{"openalex":"https://openalex.org/W2151530724","doi":"https://doi.org/10.1007/978-3-642-03367-4_14","mag":"2151530724"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-03367-4_14","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-03367-4_14","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, San Antonio, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Texas at San Antonio, San Antonio, 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, San Antonio, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Texas at San Antonio, San Antonio, 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":6.2559,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":{"value":0.9723127,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"156","last_page":"167"},"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/T12923","display_name":"Digital Image Processing Techniques","score":0.9965999722480774,"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"}},{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9962000250816345,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/voronoi-diagram","display_name":"Voronoi diagram","score":0.8693709969520569},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.7806961536407471},{"id":"https://openalex.org/keywords/euclidean-shortest-path","display_name":"Euclidean shortest path","score":0.7431081533432007},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.6749891042709351},{"id":"https://openalex.org/keywords/surface","display_name":"Surface (topology)","score":0.5979467630386353},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.5872211456298828},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.4843657910823822},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4703025221824646},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.462103009223938},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.455686092376709},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.43515175580978394},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4266554117202759},{"id":"https://openalex.org/keywords/weighted-voronoi-diagram","display_name":"Weighted Voronoi diagram","score":0.410605788230896},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3837394118309021},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.2534712255001068},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.08004418015480042}],"concepts":[{"id":"https://openalex.org/C24881265","wikidata":"https://www.wikidata.org/wiki/Q757267","display_name":"Voronoi diagram","level":2,"score":0.8693709969520569},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7806961536407471},{"id":"https://openalex.org/C170836113","wikidata":"https://www.wikidata.org/wiki/Q5406126","display_name":"Euclidean shortest path","level":5,"score":0.7431081533432007},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.6749891042709351},{"id":"https://openalex.org/C2776799497","wikidata":"https://www.wikidata.org/wiki/Q484298","display_name":"Surface (topology)","level":2,"score":0.5979467630386353},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.5872211456298828},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.4843657910823822},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4703025221824646},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.462103009223938},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.455686092376709},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.43515175580978394},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4266554117202759},{"id":"https://openalex.org/C20468658","wikidata":"https://www.wikidata.org/wiki/Q17130624","display_name":"Weighted Voronoi diagram","level":3,"score":0.410605788230896},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3837394118309021},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.2534712255001068},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.08004418015480042},{"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/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/978-3-642-03367-4_14","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-03367-4_14","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/cdeef91b-e53b-45d3-8d88-b70ff7a20392","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/cdeef91b-e53b-45d3-8d88-b70ff7a20392","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, Shortest path problems on a polyhedral surface. in F Dehne, M Gavrilova, J-R Sack & C D T\u00f3th (eds), Proceedings of the 11th International Workshop on Algorithms and Data Structures (WADS 2009), 21-23 August 2009, Banff, Alberta, Canada. Lecture Notes in Computer Science, vol. 5664, Springer, Berlin, pp. 156-167. https://doi.org/10.1007/978-3-642-03367-4_14","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:tue:oai:pure.tue.nl:publications/cdeef91b-e53b-45d3-8d88-b70ff7a20392","is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/cdeef91b-e53b-45d3-8d88-b70ff7a20392","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":"Proceedings of the 11th International Workshop on Algorithms and Data Structures (WADS 2009), 21-23 August 2009, Banff, Alberta, Canada, 156 - 167","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":52,"referenced_works":["https://openalex.org/W114049493","https://openalex.org/W142539835","https://openalex.org/W240977677","https://openalex.org/W1480502458","https://openalex.org/W1507556857","https://openalex.org/W1524296133","https://openalex.org/W1555471913","https://openalex.org/W1559701472","https://openalex.org/W1572844260","https://openalex.org/W1643884602","https://openalex.org/W1671942308","https://openalex.org/W1967005434","https://openalex.org/W1985397151","https://openalex.org/W1988367079","https://openalex.org/W1999006915","https://openalex.org/W2001513095","https://openalex.org/W2011297770","https://openalex.org/W2012386415","https://openalex.org/W2015696135","https://openalex.org/W2021746803","https://openalex.org/W2024332608","https://openalex.org/W2028747718","https://openalex.org/W2028769163","https://openalex.org/W2031247977","https://openalex.org/W2035007760","https://openalex.org/W2038699153","https://openalex.org/W2058510050","https://openalex.org/W2062556295","https://openalex.org/W2081132240","https://openalex.org/W2083244827","https://openalex.org/W2090813214","https://openalex.org/W2092924973","https://openalex.org/W2096433419","https://openalex.org/W2108567935","https://openalex.org/W2113946784","https://openalex.org/W2124299914","https://openalex.org/W2126189766","https://openalex.org/W2132339863","https://openalex.org/W2132432991","https://openalex.org/W2138069944","https://openalex.org/W2138237549","https://openalex.org/W2144713886","https://openalex.org/W2145517001","https://openalex.org/W2151530724","https://openalex.org/W2153708898","https://openalex.org/W2159549579","https://openalex.org/W2168261576","https://openalex.org/W2486666919","https://openalex.org/W2762935521","https://openalex.org/W2952397824","https://openalex.org/W4237372798","https://openalex.org/W4238518651"],"related_works":["https://openalex.org/W2360981904","https://openalex.org/W2365712669","https://openalex.org/W2347245430","https://openalex.org/W2112429204","https://openalex.org/W2562562750","https://openalex.org/W2377950158","https://openalex.org/W2018146256","https://openalex.org/W2156431668","https://openalex.org/W4200172719","https://openalex.org/W2009987517"],"abstract_inverted_index":null,"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":5}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}