Abstract
Given a set V of viewpoints and a set S of obstacles in an environmental space, the good-visibility depth of a point q in relation to V and S is a measure of how deep or central q is with respect to the points in V that see q while minding the obstacles of S. The good-visibility map determined by V and S is the subdivision of the environmental space in good-visibility regions where all points have the same fixed good-visibility depth. In this paper we present algorithms for computing and efficiently visualizing, using graphics hardware capabilities, good-visibility maps in the plane as well as on triangulated terrains, where the obstacles are the terrain faces. Finally, we present experimental results obtained with the implementation of our algorithms.
Sign-in/Register to access full text options 
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.
