Abstract

In this paper we study the following generalization of the classical hidden surface removal problem: given a set S of objects, a view point and a point light source, compute which parts of the objects in S are visible, subdivided into parts that are lit and parts that are not lit. We prove tight bounds on the maximum combinatorial complexity of such views and give efficient output-sensitive algorithms to compute the views for three cases: (i) S consists of non-intersecting triangles, (ii) S consists of horizontal axis-parallel rectangles, (iii) S is the set of faces of a polyhedral terrain.

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 call

Disclaimer: 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.