Abstract
Two query problems for visibility are considered. The first one is to find the visibility set of two query objects A and B of the same type as the objects of the given scene. The visibility set is characterized by those line segments connecting points on A and B which do not intersect scene objects between A and B. We show that scenes consisting of disjoint line segments in the plane can be processed into a data structure of about linear size so that the visibility set can be found in sublinear time per component of the representation chosen for the visibility set. The construction can also be applied to scenes of disjoint triangles in space. The disadvantage of possibly many components can be diminished by pre-clipping against the viewing hull of A and B. The query version of the clipping problem can also be solved in about linear space and sublinear query time. The result of the first problem is used for an efficient solution of the second problem which is to calculate the visibility sets between query object A and all scene objects visible from A.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
