Given a simple polygon \mathcal {P} of n vertices in the Plane. We study the problem of computing the visibility polygon from a given viewpoint q inside \mathcal {P} where only few working variables can be used. The problem was previously solved in O(n ) time using O(1) variables for working space, where denotes the cardinality of reflex vertices of \mathcal%DIFDELCMD < {%%% P in the output . In this paper, we present an optimal in-place algorithmof O(n) time, and O(1) extra variables (in addition to the being in-place) for computing visibility area . If reporting the parts of \mathcal{P linear-time and in-place algorithm for computing visibility area of a viewpoint inside a simple polygon .
Given a simple polygon \mathcal {P} of n vertices in the Plane. We study the problem of computing the visibility area from a given viewpoint q inside \mathcal {P} where only sub-linear variables are allowed for working space. Without any memory-constrained, this problem was previously solved in O(n %DIFDELCMD < {%%% ) -time and O(n) -variables space. In a newer research, the visibility area of a point be computed in O(n) -time, using O(\sqrt{n . In this paper, we present an optimal-time algorithm, using O(c/\log n) variables space for computing visibility area , where c<n is the number of critical vertices. We keep the algorithm in the linear-time and reduce space as much as possible .
R
polygon
area
R
few working variables can be used. The
sub-linear variables are allowed for working space. Without any memory-constrained, this
D
) time using O(1) variables for working space, where
D
denotes the cardinality of reflex vertices of \mathcal
D
P
R
in the output
) -time and O(n) -variables space. In a newer research, the visibility area of a point be computed in O(n) -time, using O(\sqrt{n
R
optimal in-place algorithmof O(n) time, and O(1) extra variables (in addition to the being in-place)
optimal-time algorithm, using O(c/\log n) variables space
R
. If reporting the parts of \mathcal{P
, where c<n is the number of critical vertices. We keep the algorithm in the
R
in-place algorithm for computing visibility area of a viewpoint inside a simple polygon
reduce space as much as possible