{"id":"https://openalex.org/W2159549579","doi":"https://doi.org/10.1142/s0218195996000095","title":"SHORTEST PATHS ON A POLYHEDRON, Part I: COMPUTING SHORTEST PATHS","display_name":"SHORTEST PATHS ON A POLYHEDRON, Part I: COMPUTING SHORTEST PATHS","publication_year":1996,"publication_date":"1996-06-01","ids":{"openalex":"https://openalex.org/W2159549579","doi":"https://doi.org/10.1142/s0218195996000095","mag":"2159549579"},"language":"en","primary_location":{"id":"doi:10.1142/s0218195996000095","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218195996000095","pdf_url":null,"source":{"id":"https://openalex.org/S25827807","display_name":"International Journal of Computational Geometry & Applications","issn_l":"0218-1959","issn":["0218-1959","1793-6357"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computational Geometry & Applications","raw_type":"journal-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/A5078094295","display_name":"Jindong Chen","orcid":"https://orcid.org/0000-0002-3940-9968"},"institutions":[{"id":"https://openalex.org/I143302722","display_name":"University of Kentucky","ror":"https://ror.org/02k3smh20","country_code":"US","type":"education","lineage":["https://openalex.org/I143302722"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"JINDONG CHEN","raw_affiliation_strings":["Department of Computer Science, University of Kentucky, Lexington, KY 40506, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Kentucky, Lexington, KY 40506, USA","institution_ids":["https://openalex.org/I143302722"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5091329448","display_name":"Yijie Han","orcid":"https://orcid.org/0000-0003-1305-6815"},"institutions":[{"id":"https://openalex.org/I143302722","display_name":"University of Kentucky","ror":"https://ror.org/02k3smh20","country_code":"US","type":"education","lineage":["https://openalex.org/I143302722"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"YIJIE HAN","raw_affiliation_strings":["Department of Computer Science, University of Kentucky, Lexington, KY 40506, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Kentucky, Lexington, KY 40506, USA","institution_ids":["https://openalex.org/I143302722"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.4373,"has_fulltext":false,"cited_by_count":111,"citation_normalized_percentile":{"value":0.90147493,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"06","issue":"02","first_page":"127","last_page":"144"},"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/T11106","display_name":"Data Management and Algorithms","score":0.998199999332428,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9921000003814697,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/polyhedron","display_name":"Polyhedron","score":0.8953714370727539},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.710361123085022},{"id":"https://openalex.org/keywords/euclidean-shortest-path","display_name":"Euclidean shortest path","score":0.6922085285186768},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.6766781210899353},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.6292501091957092},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.612042248249054},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.5416368246078491},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.5350059270858765},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5337235927581787},{"id":"https://openalex.org/keywords/subdivision","display_name":"Subdivision","score":0.515835702419281},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.5055091381072998},{"id":"https://openalex.org/keywords/pathfinding","display_name":"Pathfinding","score":0.497988224029541},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.4902518391609192},{"id":"https://openalex.org/keywords/convex-polytope","display_name":"Convex polytope","score":0.4542340636253357},{"id":"https://openalex.org/keywords/surface","display_name":"Surface (topology)","score":0.4323868453502655},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.43210554122924805},{"id":"https://openalex.org/keywords/floyd\u2013warshall-algorithm","display_name":"Floyd\u2013Warshall algorithm","score":0.42451706528663635},{"id":"https://openalex.org/keywords/convex-set","display_name":"Convex set","score":0.1643398404121399},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.13287398219108582},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.11326545476913452},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.06649386882781982}],"concepts":[{"id":"https://openalex.org/C54829058","wikidata":"https://www.wikidata.org/wiki/Q172937","display_name":"Polyhedron","level":2,"score":0.8953714370727539},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.710361123085022},{"id":"https://openalex.org/C170836113","wikidata":"https://www.wikidata.org/wiki/Q5406126","display_name":"Euclidean shortest path","level":5,"score":0.6922085285186768},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.6766781210899353},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.6292501091957092},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.612042248249054},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.5416368246078491},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.5350059270858765},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5337235927581787},{"id":"https://openalex.org/C143392562","wikidata":"https://www.wikidata.org/wiki/Q449111","display_name":"Subdivision","level":2,"score":0.515835702419281},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.5055091381072998},{"id":"https://openalex.org/C25321074","wikidata":"https://www.wikidata.org/wiki/Q1969601","display_name":"Pathfinding","level":4,"score":0.497988224029541},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.4902518391609192},{"id":"https://openalex.org/C110943637","wikidata":"https://www.wikidata.org/wiki/Q4129097","display_name":"Convex polytope","level":5,"score":0.4542340636253357},{"id":"https://openalex.org/C2776799497","wikidata":"https://www.wikidata.org/wiki/Q484298","display_name":"Surface (topology)","level":2,"score":0.4323868453502655},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.43210554122924805},{"id":"https://openalex.org/C186065694","wikidata":"https://www.wikidata.org/wiki/Q1047576","display_name":"Floyd\u2013Warshall algorithm","level":5,"score":0.42451706528663635},{"id":"https://openalex.org/C49870271","wikidata":"https://www.wikidata.org/wiki/Q193657","display_name":"Convex set","level":4,"score":0.1643398404121399},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.13287398219108582},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.11326545476913452},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.06649386882781982},{"id":"https://openalex.org/C166957645","wikidata":"https://www.wikidata.org/wiki/Q23498","display_name":"Archaeology","level":1,"score":0.0},{"id":"https://openalex.org/C95457728","wikidata":"https://www.wikidata.org/wiki/Q309","display_name":"History","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1142/s0218195996000095","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218195996000095","pdf_url":null,"source":{"id":"https://openalex.org/S25827807","display_name":"International Journal of Computational Geometry & Applications","issn_l":"0218-1959","issn":["0218-1959","1793-6357"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computational Geometry & Applications","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.140.3087","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.140.3087","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.csee.umkc.edu/~hanyij/research/ppath.ps","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1512906775","https://openalex.org/W1573426415","https://openalex.org/W1988367079","https://openalex.org/W2007610503","https://openalex.org/W2068376033","https://openalex.org/W2081777693","https://openalex.org/W2090813214","https://openalex.org/W2106413026","https://openalex.org/W2108567935","https://openalex.org/W2125865439","https://openalex.org/W2126876121","https://openalex.org/W2133139275","https://openalex.org/W2154394754","https://openalex.org/W2163178194","https://openalex.org/W2169528473","https://openalex.org/W2170220350","https://openalex.org/W2284630363","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2348287729","https://openalex.org/W2810620529","https://openalex.org/W2368964068","https://openalex.org/W2360981904","https://openalex.org/W2383519316","https://openalex.org/W4253588386","https://openalex.org/W1617152041","https://openalex.org/W2387829241","https://openalex.org/W3183360588","https://openalex.org/W2159549579"],"abstract_inverted_index":{"We":[0],"present":[1],"an":[2],"algorithm":[3,25,66,80],"for":[4,28,51],"determining":[5],"the":[6,14,33,38,42,45,58,74],"shortest":[7,55],"path":[8],"between":[9,57],"any":[10,29,62],"two":[11],"points":[12],"along":[13],"surface":[15,34],"of":[16,35,44,54],"a":[17,36,68],"polyhedron":[18,37,46],"which":[19,47,71],"need":[20],"not":[21],"be":[22,49],"convex.":[23],"This":[24],"also":[26],"computes":[27],"source":[30,59],"point":[31,60],"on":[32],"inward":[39],"layout":[40],"and":[41,61,87],"subdivision":[43],"can":[48],"used":[50],"processing":[52],"queries":[53],"paths":[56],"destination":[63],"point.":[64],"Our":[65,79],"uses":[67],"new":[69],"approach":[70],"deviates":[72],"from":[73],"conventional":[75],"\u201ccontinuous":[76],"Dijkstra\u201d":[77],"technique.":[78],"has":[81],"time":[82],"complexity":[83,89],"O(n":[84],"2":[85],")":[86],"space":[88],"\u0398(n).":[90]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":7},{"year":2012,"cited_by_count":7}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}