Computing the visibility polygon using few variables

From MaRDI portal



Abstract: We present several algorithms for computing the visibility polygon of a simple polygon P from a viewpoint inside the polygon, when the polygon resides in read-only memory and only few working variables can be used. The first algorithm uses a constant number of variables, and outputs the vertices of the visibility polygon in O(nRout) time, where Rout denotes the number of reflex vertices of P that are part of the output. The next two algorithms use O(logRin) variables, and output the visibility polygon in O(nlogRin) randomized expected time or O(nlog2Rin) deterministic time, where Rin is the number of reflex vertices of P.











This page was built for publication: Computing the visibility polygon using few variables

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3104601)