Showing papers by "Kamala Krithivasan published in 1998"
5 citations
TL;DR: Given a set of n rectangles parallel to xy-plane, and a point P(x,y,z) in 3-dimensional space, the visibility of all rectangles is found, i.e., the set of all visible points of rectangles from P in L 1 metric, in O(n 4) time and O( n 3) space.
Abstract: Given a set of n rectangles (2-dimensional) parallel to xy-plane, and a point P(x,y,z) in 3-dimensional space, we find the visibility of all rectangles i.e., the set of all visible points of rectangles from P in L 1 metric, in O(n 4) time and O(n 3) space. We also discuss the cases where the point P moves along a straight line and the rectangles are inserted and deleted dynamically.