A Time-Space Trade-off for the Shortest Path Tree in a Simple Polygon
2018 ◽
Vol 29
(03)
◽
pp. 391-402
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.
1995 ◽
Vol 05
(01n02)
◽
pp. 145-170
◽
Keyword(s):
2002 ◽
Vol 12
(03)
◽
pp. 249-261
◽
Keyword(s):
2010 ◽
Vol 14
(6)
◽
pp. 566-568
◽
2009 ◽
Vol 58
(4)
◽
pp. 541-557
◽
2014 ◽
pp. 283-294
◽
2014 ◽
Vol 644-650
◽
pp. 1891-1894
Keyword(s):