{"id":"https://openalex.org/W2091812190","doi":"https://doi.org/10.1145/2582112.2595650","title":"Geometric kth Shortest Paths","display_name":"Geometric kth Shortest Paths","publication_year":2014,"publication_date":"2014-05-02","ids":{"openalex":"https://openalex.org/W2091812190","doi":"https://doi.org/10.1145/2582112.2595650","mag":"2091812190"},"language":"en","primary_location":{"id":"doi:10.1145/2582112.2595650","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2582112.2595650","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the thirtieth annual symposium on Computational geometry","raw_type":"proceedings-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/A5038416046","display_name":"John Hershberger","orcid":null},"institutions":[{"id":"https://openalex.org/I105695857","display_name":"Siemens (Hungary)","ror":"https://ror.org/01rk7mv85","country_code":"HU","type":"company","lineage":["https://openalex.org/I105695857","https://openalex.org/I1325886976"]},{"id":"https://openalex.org/I4210099704","display_name":"Mentor","ror":"https://ror.org/016grqh48","country_code":"GB","type":"nonprofit","lineage":["https://openalex.org/I4210099704"]}],"countries":["GB","HU"],"is_corresponding":false,"raw_author_name":"John Hershberger","raw_affiliation_strings":["Mentor Graphics Corporation"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Mentor Graphics Corporation","institution_ids":["https://openalex.org/I105695857","https://openalex.org/I4210099704"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5104000427","display_name":"Valentin Polishchuk","orcid":null},"institutions":[{"id":"https://openalex.org/I133731052","display_name":"University of Helsinki","ror":"https://ror.org/040af2s02","country_code":"FI","type":"education","lineage":["https://openalex.org/I133731052"]}],"countries":["FI"],"is_corresponding":false,"raw_author_name":"Valentin Polishchuk","raw_affiliation_strings":["Helsinki Institute for IT, CS Dept, University of Helsinki"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Helsinki Institute for IT, CS Dept, University of Helsinki","institution_ids":["https://openalex.org/I133731052"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5000420564","display_name":"Bettina Speckmann","orcid":"https://orcid.org/0000-0002-8514-7858"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Bettina Speckmann","raw_affiliation_strings":["Dep. Mathematics and Computer Science, TU Eindhoven"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dep. Mathematics and Computer Science, TU Eindhoven","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5061060301","display_name":"Topi Talvitie","orcid":"https://orcid.org/0000-0003-0831-0997"},"institutions":[{"id":"https://openalex.org/I133731052","display_name":"University of Helsinki","ror":"https://ror.org/040af2s02","country_code":"FI","type":"education","lineage":["https://openalex.org/I133731052"]}],"countries":["FI"],"is_corresponding":false,"raw_author_name":"Topi Talvitie","raw_affiliation_strings":["Helsinki Institute for IT, CS Dept, University of Helsinki"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Helsinki Institute for IT, CS Dept, University of Helsinki","institution_ids":["https://openalex.org/I133731052"]}]}],"institutions":[],"countries_distinct_count":4,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.13,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.91469038,"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":"96","last_page":"97"},"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.9994999766349792,"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.9994999766349792,"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.9990000128746033,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9944999814033508,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5750266909599304},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.41053149104118347},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.28076809644699097}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5750266909599304},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.41053149104118347},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.28076809644699097}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/2582112.2595650","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2582112.2595650","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the thirtieth annual symposium on Computational geometry","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.tue.nl:publications/79d86af1-42a0-4471-b666-782e826542ab","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/79d86af1-42a0-4471-b666-782e826542ab","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":"Hershberger, J, Polishchuk, V, Speckmann, B & Talvitie, T 2014, Geometric kth shortest paths : the applet. in 30th ACM Symposium on Computational Geometry (SoCG, Kyoto, Japan, June 8-11, 2014). Association for Computing Machinery, Inc., New York NY, pp. 96-97, 30th Annual Symposium on Computational Geometry (SoCG 2014), Kyoto, Japan, 8/06/14. https://doi.org/10.1145/2582112.2595650","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:tue:oai:pure.tue.nl:publications/79d86af1-42a0-4471-b666-782e826542ab","is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/79d86af1-42a0-4471-b666-782e826542ab","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":"30th ACM Symposium on Computational Geometry (SoCG, Kyoto, Japan, June 8-11, 2014), 96 - 97","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":3,"referenced_works":["https://openalex.org/W2058510050","https://openalex.org/W2091812190","https://openalex.org/W2282234940"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2748952813","https://openalex.org/W2390279801","https://openalex.org/W2358668433","https://openalex.org/W4396701345","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W4396696052","https://openalex.org/W4402327032","https://openalex.org/W2382290278"],"abstract_inverted_index":{"No":[0],"abstract":[1],"available.":[2]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}