{"id":"https://openalex.org/W2802808933","doi":"https://doi.org/10.1142/s0129054118500107","title":"A Time-Space Trade-off for the Shortest Path Tree in a Simple Polygon","display_name":"A Time-Space Trade-off for the Shortest Path Tree in a Simple Polygon","publication_year":2018,"publication_date":"2018-04-01","ids":{"openalex":"https://openalex.org/W2802808933","doi":"https://doi.org/10.1142/s0129054118500107","mag":"2802808933"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054118500107","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054118500107","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"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 Foundations of Computer Science","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/A5026122360","display_name":"Pardis Kavand","orcid":null},"institutions":[{"id":"https://openalex.org/I158248296","display_name":"Amirkabir University of Technology","ror":"https://ror.org/04gzbav43","country_code":"IR","type":"education","lineage":["https://openalex.org/I158248296"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Pardis Kavand","raw_affiliation_strings":["Laboratory of Algorithms and Computational Geometry, Department of Mathematics and Computer Science, Amirkabir University of Technology, 424 Hafez Ave, Tehran 009821, Iran"],"affiliations":[{"raw_affiliation_string":"Laboratory of Algorithms and Computational Geometry, Department of Mathematics and Computer Science, Amirkabir University of Technology, 424 Hafez Ave, Tehran 009821, Iran","institution_ids":["https://openalex.org/I158248296"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5027094623","display_name":"Ali Mohades","orcid":"https://orcid.org/0000-0002-6118-2245"},"institutions":[{"id":"https://openalex.org/I158248296","display_name":"Amirkabir University of Technology","ror":"https://ror.org/04gzbav43","country_code":"IR","type":"education","lineage":["https://openalex.org/I158248296"]}],"countries":["IR"],"is_corresponding":true,"raw_author_name":"Ali Mohades","raw_affiliation_strings":["Laboratory of Algorithms and Computational Geometry, Department of Mathematics and Computer Science, Amirkabir University of Technology, 424 Hafez Ave, Tehran 009821, Iran"],"affiliations":[{"raw_affiliation_string":"Laboratory of Algorithms and Computational Geometry, Department of Mathematics and Computer Science, Amirkabir University of Technology, 424 Hafez Ave, Tehran 009821, Iran","institution_ids":["https://openalex.org/I158248296"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5027094623"],"corresponding_institution_ids":["https://openalex.org/I158248296"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.07826867,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"29","issue":"03","first_page":"391","last_page":"402"},"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.9995999932289124,"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.9995999932289124,"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/T10481","display_name":"Computer Graphics and Visualization Techniques","score":0.9810000061988831,"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/simple-polygon","display_name":"Simple polygon","score":0.8895906209945679},{"id":"https://openalex.org/keywords/polygon","display_name":"Polygon (computer graphics)","score":0.7726829648017883},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.6676138043403625},{"id":"https://openalex.org/keywords/workspace","display_name":"Workspace","score":0.6520758867263794},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6025675535202026},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5616492033004761},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.5591626167297363},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5046173334121704},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.47824326157569885},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.470179945230484},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4693763256072998},{"id":"https://openalex.org/keywords/polygon-covering","display_name":"Polygon covering","score":0.46359485387802124},{"id":"https://openalex.org/keywords/visibility-polygon","display_name":"Visibility polygon","score":0.43161624670028687},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.4209798574447632},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.36693817377090454},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.12689459323883057},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.10134199261665344}],"concepts":[{"id":"https://openalex.org/C197949415","wikidata":"https://www.wikidata.org/wiki/Q782746","display_name":"Simple polygon","level":3,"score":0.8895906209945679},{"id":"https://openalex.org/C190694206","wikidata":"https://www.wikidata.org/wiki/Q3276654","display_name":"Polygon (computer graphics)","level":3,"score":0.7726829648017883},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.6676138043403625},{"id":"https://openalex.org/C58581272","wikidata":"https://www.wikidata.org/wiki/Q12741163","display_name":"Workspace","level":3,"score":0.6520758867263794},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6025675535202026},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5616492033004761},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.5591626167297363},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5046173334121704},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.47824326157569885},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.470179945230484},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4693763256072998},{"id":"https://openalex.org/C187778580","wikidata":"https://www.wikidata.org/wiki/Q18389289","display_name":"Polygon covering","level":3,"score":0.46359485387802124},{"id":"https://openalex.org/C1449246","wikidata":"https://www.wikidata.org/wiki/Q7936080","display_name":"Visibility polygon","level":4,"score":0.43161624670028687},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.4209798574447632},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.36693817377090454},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.12689459323883057},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.10134199261665344},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C126042441","wikidata":"https://www.wikidata.org/wiki/Q1324888","display_name":"Frame (networking)","level":2,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0129054118500107","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054118500107","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"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 Foundations of Computer Science","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W1978331593","https://openalex.org/W2039511348","https://openalex.org/W2103678784","https://openalex.org/W2125293312","https://openalex.org/W2132339863","https://openalex.org/W4298410530"],"related_works":["https://openalex.org/W2608536130","https://openalex.org/W2154329468","https://openalex.org/W2372903818","https://openalex.org/W2102467404","https://openalex.org/W53644101","https://openalex.org/W2362265576","https://openalex.org/W2362048241","https://openalex.org/W2389833224","https://openalex.org/W2987051945","https://openalex.org/W2380220436"],"abstract_inverted_index":{"A":[0],"[Formula:":[1,10,33,40,54,58,72,77,97],"see":[2,11,34,41,55,59,73,78,98],"text]-workspace":[3,42],"algorithm":[4,43],"may":[5],"use":[6],"a":[7,29,39,51,65,89,93],"workspace":[8],"of":[9,32,50,88,102],"text]":[12,35,56,60,74,79,99],"words":[13,101],"which":[14,25],"can":[15],"be":[16],"read":[17],"and":[18],"written,":[19],"in":[20,71],"addition":[21],"to":[22,64],"their":[23],"input,":[24],"is":[26,80],"provided":[27],"as":[28],"read-only":[30],"array":[31],"items.":[36],"We":[37],"present":[38],"for":[44,83],"constructing":[45],"the":[46,69,81,85],"shortest":[47],"path":[48],"tree":[49],"simple":[52,94],"polygon":[53,70,87,95],"with":[57,62,96],"vertices,":[61],"respect":[63],"given":[66,90],"point":[67,91],"inside":[68,92],"time,":[75],"where":[76],"time":[82],"computing":[84],"visibility":[86],"additional":[100],"space.":[103]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}