Visibility of rectagular objects inL1metric
The paper investigates the problem of computing the visibility of geometric objects from a source point. Given a set of \(n\) 2D-rectangles parallel to the \(xy\)-plane and a point \(P(x,y,z)\) in the 3D-space, the authors provide an algorithm that find the visibility of all rectangles, i.e. the set of all visible points of rectangles from \(P\), in the \(L_1\) metric. The computational complexity of the visibility obtained algorithm is \(O(n^4)\) in time and \(O(n^3)\) in space. Visibility algorithms are also provided for the case when the point \(P\) is moved along one of the coordinate axes, and the rectangles are inserted and deleted dynamically.
This page was built for publication: Visibility of rectagular objects inL1metric
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4236100)