{"id":"https://openalex.org/W2081888796","doi":"https://doi.org/10.1007/s00453-012-9723-6","title":"Shortest Path Problems on a Polyhedral Surface","display_name":"Shortest Path Problems on a Polyhedral Surface","publication_year":2012,"publication_date":"2012-11-28","ids":{"openalex":"https://openalex.org/W2081888796","doi":"https://doi.org/10.1007/s00453-012-9723-6","mag":"2081888796"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-012-9723-6","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-012-9723-6","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":true,"oa_status":"green","oa_url":"https://research.tue.nl/nl/publications/bae2365c-b960-42a6-9657-e1b28f0c93d8","any_repository_has_fulltext":true},"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","University of Texas at San Antonio"],"raw_orcid":null,"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"]},{"raw_affiliation_string":"University of Texas at San Antonio","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/I114832834","display_name":"Tulane University","ror":"https://ror.org/04vmvtb21","country_code":"US","type":"education","lineage":["https://openalex.org/I114832834"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Carola Wenk","raw_affiliation_strings":["Department of Computer Science, Tulane University, 6823 St. Charles Ave., New Orleans, LA, 70118, USA","Tulane University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Tulane University, 6823 St. Charles Ave., New Orleans, LA, 70118, USA","institution_ids":["https://openalex.org/I114832834"]},{"raw_affiliation_string":"Tulane University","institution_ids":["https://openalex.org/I114832834"]}]}],"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":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":3.5828,"has_fulltext":true,"cited_by_count":9,"citation_normalized_percentile":{"value":0.92508569,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"69","issue":"1","first_page":"58","last_page":"77"},"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/T12536","display_name":"Topological and Geometric Data Analysis","score":0.9952999949455261,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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.9939000010490417,"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/combinatorics","display_name":"Combinatorics","score":0.6704468727111816},{"id":"https://openalex.org/keywords/surface","display_name":"Surface (topology)","score":0.655349612236023},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6221659183502197},{"id":"https://openalex.org/keywords/polyhedron","display_name":"Polyhedron","score":0.6199493408203125},{"id":"https://openalex.org/keywords/voronoi-diagram","display_name":"Voronoi diagram","score":0.6024255156517029},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6021680235862732},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.5845053195953369},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.4617936611175537},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.44021475315093994},{"id":"https://openalex.org/keywords/star","display_name":"Star (game theory)","score":0.4381484091281891},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.4351869225502014},{"id":"https://openalex.org/keywords/euclidean-shortest-path","display_name":"Euclidean shortest path","score":0.4105432629585266},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.23538702726364136},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.23464256525039673},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.22948342561721802},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.09692957997322083},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.09654960036277771},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.07147318124771118}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6704468727111816},{"id":"https://openalex.org/C2776799497","wikidata":"https://www.wikidata.org/wiki/Q484298","display_name":"Surface (topology)","level":2,"score":0.655349612236023},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6221659183502197},{"id":"https://openalex.org/C54829058","wikidata":"https://www.wikidata.org/wiki/Q172937","display_name":"Polyhedron","level":2,"score":0.6199493408203125},{"id":"https://openalex.org/C24881265","wikidata":"https://www.wikidata.org/wiki/Q757267","display_name":"Voronoi diagram","level":2,"score":0.6024255156517029},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6021680235862732},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.5845053195953369},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.4617936611175537},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.44021475315093994},{"id":"https://openalex.org/C2780897414","wikidata":"https://www.wikidata.org/wiki/Q7600592","display_name":"Star (game theory)","level":2,"score":0.4381484091281891},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.4351869225502014},{"id":"https://openalex.org/C170836113","wikidata":"https://www.wikidata.org/wiki/Q5406126","display_name":"Euclidean shortest path","level":5,"score":0.4105432629585266},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.23538702726364136},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.23464256525039673},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.22948342561721802},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.09692957997322083},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.09654960036277771},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.07147318124771118},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":10,"locations":[{"id":"doi:10.1007/s00453-012-9723-6","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-012-9723-6","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:tue:oai:pure.tue.nl:publications/bae2365c-b960-42a6-9657-e1b28f0c93d8","is_oa":true,"landing_page_url":"https://research.tue.nl/nl/publications/bae2365c-b960-42a6-9657-e1b28f0c93d8","pdf_url":"https://research.tue.nl/nl/publications/bae2365c-b960-42a6-9657-e1b28f0c93d8","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":"Abstracts 25th European Workshop on Computational Geometry (EuroCG'09, Brussels, Belgium, March 16-18, 2009), 179 - 182","raw_type":"info:eu-repo/semantics/conferencepaper"},{"id":"pmh:661868","is_oa":false,"landing_page_url":"http://library.tue.nl/csp/dare/LinkToRepository.csp?recordnumber=661868","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","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:666496","is_oa":false,"landing_page_url":"http://library.tue.nl/csp/dare/LinkToRepository.csp?recordnumber=666496","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","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:oai:CiteSeerX.psu:10.1.1.157.5721","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.157.5721","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://venom.cs.utsa.edu/dmz/techrep/2009/CS-TR-2009-001.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.158.119","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.158.119","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.utsa.edu/~carola/WADS_2009_Polyhedral_Surface.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.158.2849","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.158.2849","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.utsa.edu/~carola/EuroCG2009.pdf","raw_type":"text"},{"id":"pmh:oai:library.tue.nl:661868","is_oa":false,"landing_page_url":"http://repository.tue.nl/661868","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","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:oai:library.tue.nl:666496","is_oa":false,"landing_page_url":"http://repository.tue.nl/666496","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","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:oai:pure.tue.nl:openaire_cris_publications/bae2365c-b960-42a6-9657-e1b28f0c93d8","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/bae2365c-b960-42a6-9657-e1b28f0c93d8","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Cook IV, A F & Wenk, C 2009, Shortest path problems on a polyhedral surface. in Abstracts 25th European Workshop on Computational Geometry (EuroCG'09, Brussels, Belgium, March 16-18, 2009). pp. 179-182.","raw_type":"contributionToPeriodical"}],"best_oa_location":{"id":"pmh:tue:oai:pure.tue.nl:publications/bae2365c-b960-42a6-9657-e1b28f0c93d8","is_oa":true,"landing_page_url":"https://research.tue.nl/nl/publications/bae2365c-b960-42a6-9657-e1b28f0c93d8","pdf_url":"https://research.tue.nl/nl/publications/bae2365c-b960-42a6-9657-e1b28f0c93d8","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":"Abstracts 25th European Workshop on Computational Geometry (EuroCG'09, Brussels, Belgium, March 16-18, 2009), 179 - 182","raw_type":"info:eu-repo/semantics/conferencepaper"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2081888796.pdf","grobid_xml":"https://content.openalex.org/works/W2081888796.grobid-xml"},"referenced_works_count":40,"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/W1555471913","https://openalex.org/W1559701472","https://openalex.org/W1572844260","https://openalex.org/W1643884602","https://openalex.org/W1967005434","https://openalex.org/W1988367079","https://openalex.org/W2011297770","https://openalex.org/W2012386415","https://openalex.org/W2013382394","https://openalex.org/W2024332608","https://openalex.org/W2028747718","https://openalex.org/W2028769163","https://openalex.org/W2031247977","https://openalex.org/W2058510050","https://openalex.org/W2062556295","https://openalex.org/W2081132240","https://openalex.org/W2090813214","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/W2138237549","https://openalex.org/W2145517001","https://openalex.org/W2151530724","https://openalex.org/W2153708898","https://openalex.org/W2159549579","https://openalex.org/W2168261576","https://openalex.org/W2952397824","https://openalex.org/W4237372798","https://openalex.org/W4238518651","https://openalex.org/W4239339957","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W1632146954","https://openalex.org/W2085804021","https://openalex.org/W2099686509","https://openalex.org/W2148155904","https://openalex.org/W2324334139","https://openalex.org/W2612071326","https://openalex.org/W15378492","https://openalex.org/W1588722399","https://openalex.org/W164576073","https://openalex.org/W2111281539"],"abstract_inverted_index":null,"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2026-05-02T08:42:23.175194","created_date":"2025-10-10T00:00:00"}