{"id":"https://openalex.org/W7095743665","doi":null,"title":"Generalized Source Shortest Paths on Polyhedral Surfaces","display_name":"Generalized Source Shortest Paths on Polyhedral Surfaces","alternate_titles":[],"publication_year":null,"publication_date":null,"ids":{"openalex":"https://openalex.org/W7095743665"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.89.7266","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.89.7266","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://ima.udg.edu/~mfort/publications/GSSPOPSEuroCG07.pdf","raw_type":"text"},"parent_works":[],"lineage":["https://openalex.org/W7095743665"],"child_works_count":0,"type":"article","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Marta Fort, et al.","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":true,"contributor_roles":[],"raw_author_name":"Marta Fort, et al.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9984999895095825,"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.9984999895095825,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.0007999999797903001,"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/T10481","display_name":"Computer Graphics and Visualization Techniques","score":9.999999747378752e-05,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/shortest-path","display_name":"shortest path","score":0.9300000071525574},{"id":"https://openalex.org/keywords/polyhedral-surfaces","display_name":"polyhedral surfaces","score":0.8849999904632568},{"id":"https://openalex.org/keywords/distance-computation","display_name":"distance computation","score":0.6129999756813049},{"id":"https://openalex.org/keywords/polygonal-obstacles","display_name":"polygonal obstacles","score":0.7760000228881836},{"id":"https://openalex.org/keywords/voronoi-diagram","display_name":"Voronoi tessellation","score":0.7979999780654907},{"id":"https://openalex.org/keywords/computational-geometry-algorithms","display_name":"computational geometry algorithms","score":0.7360000014305115}],"concepts":[{"id":"https://openalex.org/C24881265","wikidata":"https://www.wikidata.org/wiki/Q757267","display_name":"Voronoi diagram","level":2,"score":0.6427000164985657},{"id":"https://openalex.org/C190694206","wikidata":"https://www.wikidata.org/wiki/Q3276654","display_name":"Polygon (computer graphics)","level":3,"score":0.6116999983787537},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.597599983215332},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5410000085830688},{"id":"https://openalex.org/C2776799497","wikidata":"https://www.wikidata.org/wiki/Q484298","display_name":"Surface (topology)","level":2,"score":0.5202999711036682},{"id":"https://openalex.org/C29123130","wikidata":"https://www.wikidata.org/wiki/Q874709","display_name":"Computational geometry","level":2,"score":0.5135999917984009},{"id":"https://openalex.org/C182860218","wikidata":"https://www.wikidata.org/wiki/Q633674","display_name":"Polygonal chain","level":3,"score":0.5008000135421753},{"id":"https://openalex.org/C199185054","wikidata":"https://www.wikidata.org/wiki/Q552299","display_name":"Chain (unit)","level":2,"score":0.4830000102519989},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.47909998893737793},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.4634999930858612},{"id":"https://openalex.org/C197949415","wikidata":"https://www.wikidata.org/wiki/Q782746","display_name":"Simple polygon","level":3,"score":0.41499999165534973},{"id":"https://openalex.org/C135981907","wikidata":"https://www.wikidata.org/wiki/Q188056","display_name":"Triangulation","level":2,"score":0.3756999969482422},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.36399999260902405},{"id":"https://openalex.org/C186399060","wikidata":"https://www.wikidata.org/wiki/Q959962","display_name":"Diagram","level":2,"score":0.35120001435279846},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.3467999994754791},{"id":"https://openalex.org/C145691206","wikidata":"https://www.wikidata.org/wiki/Q747980","display_name":"Polytope","level":2,"score":0.3328000009059906},{"id":"https://openalex.org/C205672865","wikidata":"https://www.wikidata.org/wiki/Q5062961","display_name":"Centroidal Voronoi tessellation","level":3,"score":0.3292999863624573},{"id":"https://openalex.org/C54829058","wikidata":"https://www.wikidata.org/wiki/Q172937","display_name":"Polyhedron","level":2,"score":0.32330000400543213},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.32170000672340393},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32010000944137573},{"id":"https://openalex.org/C113391598","wikidata":"https://www.wikidata.org/wiki/Q1681391","display_name":"Polytope model","level":3,"score":0.31940001249313354},{"id":"https://openalex.org/C2780034980","wikidata":"https://www.wikidata.org/wiki/Q3259505","display_name":"Convex polygon","level":3,"score":0.30720001459121704},{"id":"https://openalex.org/C182124507","wikidata":"https://www.wikidata.org/wiki/Q166154","display_name":"Line segment","level":2,"score":0.2874999940395355},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2806999981403351},{"id":"https://openalex.org/C20573064","wikidata":"https://www.wikidata.org/wiki/Q13410436","display_name":"Power diagram","level":3,"score":0.2685999870300293},{"id":"https://openalex.org/C187778580","wikidata":"https://www.wikidata.org/wiki/Q18389289","display_name":"Polygon covering","level":3,"score":0.26840001344680786},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.2655999958515167},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2637999951839447},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.25589999556541443}],"mesh":[],"locations_count":1,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.89.7266","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.89.7266","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://ima.udg.edu/~mfort/publications/GSSPOPSEuroCG07.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W7028513189","https://openalex.org/W2124887759","https://openalex.org/W7095084820","https://openalex.org/W1599333084","https://openalex.org/W2108567935","https://openalex.org/W2075927382","https://openalex.org/W4241228335","https://openalex.org/W2511426672","https://openalex.org/W240977677","https://openalex.org/W2109278560"],"abstract_inverted_index":{"We":[0],"present":[1],"an":[2],"algorithm":[3,32],"for":[4],"computing":[5],"shortest":[6],"paths":[7],"and":[8],"distances":[9],"from":[10],"a":[11,26,69],"single":[12],"generalized":[13,59,72],"source":[14],"(point,":[15],"segment,":[16],"polygonal":[17,39],"chain":[18,40],"or":[19,41],"polygon)":[20],"to":[21,54,61],"any":[22],"query":[23],"point":[24],"on":[25,44,74],"possibly":[27],"non-convex":[28],"polyhedral":[29,46,76],"surface.":[30,77],"The":[31],"also":[33],"handles":[34],"the":[35,45,55,63,75],"case":[36,56],"in":[37],"which":[38],"polygon":[42],"obstacles":[43],"surface":[47],"are":[48],"allowed.":[49],"Moreover,":[50],"it":[51],"easily":[52],"extends":[53],"of":[57,68,71],"several":[58],"sources":[60],"compute":[62],"(implicitly":[64],"represented)":[65],"Voronoi":[66],"diagram":[67],"set":[70],"sites":[73]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W7095743665","counts_by_year":[{"year":2014,"cited_by_count":1}],"updated_date":"2026-11-16T12:05:36.265796","created_date":"2025-10-27T00:00:00"}
