{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T03:37:36Z","timestamp":1648611456493},"reference-count":7,"publisher":"World Scientific Pub Co Pte Lt","issue":"03","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2018,4]]},"abstract":"<jats:p> A [Formula: see text]-workspace algorithm may use a workspace of [Formula: see text] words which can be read and written, in addition to their input, which is provided as a read-only array of [Formula: see text] items. We present a [Formula: see text]-workspace algorithm for constructing the shortest path tree of a simple polygon [Formula: see text] with [Formula: see text] vertices, with respect to a given point inside the polygon in [Formula: see text] time, where [Formula: see text] is the time for computing the visibility polygon of a given point inside a simple polygon with [Formula: see text] additional words of space. <\/jats:p>","DOI":"10.1142\/s0129054118500107","type":"journal-article","created":{"date-parts":[[2018,5,8]],"date-time":"2018-05-08T04:13:37Z","timestamp":1525752817000},"page":"391-402","source":"Crossref","is-referenced-by-count":0,"title":["A Time-Space Trade-off for the Shortest Path Tree in a Simple Polygon"],"prefix":"10.1142","volume":"29","author":[{"given":"Pardis","family":"Kavand","sequence":"first","affiliation":[{"name":"Laboratory of Algorithms and Computational Geometry, Department of Mathematics and Computer Science, Amirkabir University of Technology, 424 Hafez Ave, Tehran 009821, Iran"}]},{"given":"Ali","family":"Mohades","sequence":"additional","affiliation":[{"name":"Laboratory of Algorithms and Computational Geometry, Department of Mathematics and Computer Science, Amirkabir University of Technology, 424 Hafez Ave, Tehran 009821, Iran"}]}],"member":"219","published-online":{"date-parts":[[2018,5,7]]},"reference":[{"key":"S0129054118500107BIB001","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2013.04.005"},{"key":"S0129054118500107BIB003","first-page":"46","volume":"2","author":"Asano T.","year":"2011","journal-title":"J. Comput. Geom."},{"key":"S0129054118500107BIB004","doi-asserted-by":"publisher","DOI":"10.7155\/jgaa.00240"},{"key":"S0129054118500107BIB005","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-014-9893-5"},{"key":"S0129054118500107BIB006","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2014.04.001"},{"key":"S0129054118500107BIB007","doi-asserted-by":"publisher","DOI":"10.1007\/BF01840360"},{"key":"S0129054118500107BIB009","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804120"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054118500107","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T19:26:48Z","timestamp":1565119608000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054118500107"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,4]]},"references-count":7,"journal-issue":{"issue":"03","published-online":{"date-parts":[[2018,5,7]]},"published-print":{"date-parts":[[2018,4]]}},"alternative-id":["10.1142\/S0129054118500107"],"URL":"https:\/\/doi.org\/10.1142\/s0129054118500107","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,4]]}}}