We study the problem of k-visibility in the memoryconstrained model. In this model, the input resides in a randomly accessible read-only memory of O(n) words with O(log n) bits each. An algorithm can read and write O(s) additional words of workspace during its execution, and it writes its output to write-only memory. In a given polygon P , for a given point q ∈ P , we say a point p is inside th...
