{"id":"https://openalex.org/W6907575754","doi":"https://doi.org/10.20382/jocg.v15i2a6","title":"Shortest paths in portalgons","display_name":"Shortest paths in portalgons","publication_year":2025,"publication_date":"2025-01-29","ids":{"openalex":"https://openalex.org/W6907575754","doi":"https://doi.org/10.20382/jocg.v15i2a6"},"language":"en","primary_location":{"id":"pmh:oai:pure.tue.nl:openaire_cris_publications/c280ef97-de85-4284-b3f2-99e79aeae712","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/c280ef97-de85-4284-b3f2-99e79aeae712","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Ophelders, T, L\u00f6ffler, M, Silveira, R I & Staals, F 2024, 'Shortest paths in portalgons', Journal of Computational Geometry, vol. 15, no. 2, pp. 174-221. https://doi.org/10.20382/jocg.v15i2a6","raw_type":"info:eu-repo/semantics/publishedVersion"},"type":"article","indexed_in":["datacite","doaj"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://research.tue.nl/en/publications/c280ef97-de85-4284-b3f2-99e79aeae712","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Ophelders, Tim","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"]},{"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":"Ophelders, Tim","raw_affiliation_strings":["Utrecht University and TU Eindhoven"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Utrecht University and TU Eindhoven","institution_ids":["https://openalex.org/I83019370","https://openalex.org/I193662353"]}]},{"author_position":"middle","author":{"id":null,"display_name":"L\u00f6ffler, Maarten","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":"L\u00f6ffler, Maarten","raw_affiliation_strings":["Utrecht University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Utrecht University","institution_ids":["https://openalex.org/I193662353"]}]},{"author_position":"middle","author":{"id":null,"display_name":"I. Silveira, Rodrigo","orcid":null},"institutions":[{"id":"https://openalex.org/I9617848","display_name":"Universitat Polit\u00e8cnica de Catalunya","ror":"https://ror.org/03mb6wj31","country_code":"ES","type":"education","lineage":["https://openalex.org/I9617848"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"I. Silveira, Rodrigo","raw_affiliation_strings":["Universitat Polit\u00e8cnica de Catalunya"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universitat Polit\u00e8cnica de Catalunya","institution_ids":["https://openalex.org/I9617848"]}]},{"author_position":"last","author":{"id":null,"display_name":"Staals, Frank","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":"Staals, Frank","raw_affiliation_strings":["Utrecht University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Utrecht University","institution_ids":["https://openalex.org/I193662353"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.58524567,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9488000273704529,"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.9488000273704529,"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.016899999231100082,"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/T12536","display_name":"Topological and Geometric Data Analysis","score":0.005400000140070915,"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/delaunay-triangulation","display_name":"Delaunay triangulation","score":0.8184000253677368},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.7057999968528748},{"id":"https://openalex.org/keywords/euclidean-shortest-path","display_name":"Euclidean shortest path","score":0.6614000201225281},{"id":"https://openalex.org/keywords/geodesic","display_name":"Geodesic","score":0.49380001425743103},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.453000009059906},{"id":"https://openalex.org/keywords/constrained-delaunay-triangulation","display_name":"Constrained Delaunay triangulation","score":0.42260000109672546},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.37599998712539673},{"id":"https://openalex.org/keywords/metric-space","display_name":"Metric space","score":0.36730000376701355}],"concepts":[{"id":"https://openalex.org/C68010082","wikidata":"https://www.wikidata.org/wiki/Q192445","display_name":"Delaunay triangulation","level":2,"score":0.8184000253677368},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7487000226974487},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7057999968528748},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6834999918937683},{"id":"https://openalex.org/C170836113","wikidata":"https://www.wikidata.org/wiki/Q5406126","display_name":"Euclidean shortest path","level":5,"score":0.6614000201225281},{"id":"https://openalex.org/C165818556","wikidata":"https://www.wikidata.org/wiki/Q213488","display_name":"Geodesic","level":2,"score":0.49380001425743103},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.453000009059906},{"id":"https://openalex.org/C128321387","wikidata":"https://www.wikidata.org/wiki/Q5164356","display_name":"Constrained Delaunay triangulation","level":3,"score":0.42260000109672546},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40139999985694885},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.37599998712539673},{"id":"https://openalex.org/C198043062","wikidata":"https://www.wikidata.org/wiki/Q180953","display_name":"Metric space","level":2,"score":0.36730000376701355},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.3504999876022339},{"id":"https://openalex.org/C135981907","wikidata":"https://www.wikidata.org/wiki/Q188056","display_name":"Triangulation","level":2,"score":0.34380000829696655},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.3292999863624573},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.3163999915122986},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.3012999892234802},{"id":"https://openalex.org/C2776799497","wikidata":"https://www.wikidata.org/wiki/Q484298","display_name":"Surface (topology)","level":2,"score":0.29679998755455017},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.28380000591278076},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.2741999924182892},{"id":"https://openalex.org/C54385418","wikidata":"https://www.wikidata.org/wiki/Q2742711","display_name":"Distance","level":4,"score":0.2702000141143799},{"id":"https://openalex.org/C182124507","wikidata":"https://www.wikidata.org/wiki/Q166154","display_name":"Line segment","level":2,"score":0.26489999890327454},{"id":"https://openalex.org/C197949415","wikidata":"https://www.wikidata.org/wiki/Q782746","display_name":"Simple polygon","level":3,"score":0.25290000438690186}],"mesh":[],"locations_count":5,"locations":[{"id":"pmh:oai:pure.tue.nl:openaire_cris_publications/c280ef97-de85-4284-b3f2-99e79aeae712","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/c280ef97-de85-4284-b3f2-99e79aeae712","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Ophelders, T, L\u00f6ffler, M, Silveira, R I & Staals, F 2024, 'Shortest paths in portalgons', Journal of Computational Geometry, vol. 15, no. 2, pp. 174-221. https://doi.org/10.20382/jocg.v15i2a6","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:upcommons.upc.edu:2117/428421","is_oa":true,"landing_page_url":"https://hdl.handle.net/2117/428421","pdf_url":"https://upcommons.upc.edu/bitstreams/dedf59c0-3c8d-4b61-a7cf-f7646f762634/download","source":{"id":"https://openalex.org/S4377196262","display_name":"UPCommons institutional repository (Universitat Polit\u00e8cnica de Catalunya)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I9617848","host_organization_name":"Universitat Polit\u00e8cnica de Catalunya","host_organization_lineage":["https://openalex.org/I9617848"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:ojs.library.carleton.ca:article/5173","is_oa":true,"landing_page_url":"https://jocg.org/index.php/jocg/article/view/5173","pdf_url":"https://jocg.org/index.php/jocg/article/download/5173/3731","source":{"id":"https://openalex.org/S4306400962","display_name":"Journal of Computational Geometry (Carleton University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67031392","host_organization_name":"Carleton University","host_organization_lineage":["https://openalex.org/I67031392"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"10.20382/jocg.v15i2","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:doaj.org/article:d0d9d39d7aae4deda7e0b3f305bbef07","is_oa":true,"landing_page_url":"https://doaj.org/article/d0d9d39d7aae4deda7e0b3f305bbef07","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","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":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Journal of Computational Geometry, Vol 15, Iss 2 (2025)","raw_type":"article"},{"id":"doi:10.20382/jocg.v15i2a6","is_oa":true,"landing_page_url":"https://doi.org/10.20382/jocg.v15i2a6","pdf_url":null,"source":{"id":"https://openalex.org/S4306400962","display_name":"Journal of Computational Geometry (Carleton University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67031392","host_organization_name":"Carleton University","host_organization_lineage":["https://openalex.org/I67031392"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"}],"best_oa_location":{"id":"pmh:oai:pure.tue.nl:openaire_cris_publications/c280ef97-de85-4284-b3f2-99e79aeae712","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/c280ef97-de85-4284-b3f2-99e79aeae712","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Ophelders, T, L\u00f6ffler, M, Silveira, R I & Staals, F 2024, 'Shortest paths in portalgons', Journal of Computational Geometry, vol. 15, no. 2, pp. 174-221. https://doi.org/10.20382/jocg.v15i2a6","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2262748287","display_name":null,"funder_award_id":"501100011033","funder_id":"https://openalex.org/F4320335598","funder_display_name":"Agencia Estatal de Investigaci\u00f3n"},{"id":"https://openalex.org/G3480869486","display_name":null,"funder_award_id":"13039","funder_id":"https://openalex.org/F4320335598","funder_display_name":"Agencia Estatal de Investigaci\u00f3n"},{"id":"https://openalex.org/G464105488","display_name":null,"funder_award_id":"PID2023","funder_id":"https://openalex.org/F4320335598","funder_display_name":"Agencia Estatal de Investigaci\u00f3n"},{"id":"https://openalex.org/G7084143925","display_name":null,"funder_award_id":"AEI/10","funder_id":"https://openalex.org/F4320335598","funder_display_name":"Agencia Estatal de Investigaci\u00f3n"},{"id":"https://openalex.org/G7266728691","display_name":null,"funder_award_id":"13039/501100011033","funder_id":"https://openalex.org/F4320335598","funder_display_name":"Agencia Estatal de Investigaci\u00f3n"}],"funders":[{"id":"https://openalex.org/F4320335598","display_name":"Agencia Estatal de Investigaci\u00f3n","ror":null}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Any":[0],"surface":[1,139],"that":[2,115,131],"is":[3,27,90,122],"intrinsically":[4],"polyhedral":[5,138],"can":[6],"be":[7,152],"represented":[8],"by":[9,129],"a":[10,42,45,69,83,116,120,142,164],"collection":[11],"of":[12,19,64,86,94,113,136,167],"simple":[13],"polygons":[14],"(fragments),":[15],"glued":[16],"along":[17],"pairs":[18],"equally":[20],"long":[21],"oriented":[22],"edges,":[23],"where":[24],"each":[25],"fragment":[26,70,121],"endowed":[28],"with":[29],"the":[30,54,62,77,132,147],"geodesic":[31],"metric":[32],"arising":[33],"from":[34],"its":[35,95],"Euclidean":[36],"metric.":[37],"We":[38,60,67,99,126],"refer":[39],"to":[40,104,141,159],"such":[41],"representation":[43],"as":[44],"portalgon,":[46],"and":[47],"we":[48,154],"call":[49,68],"two":[50],"portalgons":[51,162],"equivalent":[52],"if":[53,72,92],"surfaces":[55],"they":[56],"represent":[57],"are":[58,97],"isometric.":[59],"analyze":[61],"complexity":[63],"shortest":[65,74,106,117],"paths.":[66],"happy":[71,91,109,143,161],"any":[73,137],"path":[75,118],"on":[76,108],"portalgon":[78,89],"visits":[79,119],"it":[80],"at":[81],"most":[82],"constant":[84],"number":[85,112],"times.":[87],"A":[88],"all":[93],"fragments":[96],"happy.":[98],"present":[100],"an":[101,156],"efficient":[102,157],"algorithm":[103,158],"compute":[105,160],"paths":[107],"portalgons.":[110,168],"The":[111],"times":[114],"unbounded":[123],"in":[124],"general.":[125],"contrast":[127],"this":[128],"showing":[130],"intrinsic":[133,148],"Delaunay":[134,149],"triangulation":[135,150],"corresponds":[140],"portalgon.":[144],"Since":[145],"computing":[146],"may":[151],"inefficient,":[153],"provide":[155],"for":[163],"restricted":[165],"class":[166]},"counts_by_year":[],"updated_date":"2026-06-14T07:44:22.658603","created_date":"2025-10-10T00:00:00"}