Abstract
It is known that a scene consiing of k convex polyhedra of total complexity n has at most O(n4 k2) distinct orthographic views, and that the number of such views is ?((nk2 + n2)2) in the worst case. The coresponding bounds for perspective views are O(n6 k3) and ?((nk2 + n2)3), respectively. In this paper, we close these gaps by improving the lower bounds. We construct an example of a scene with ?(n6 k2) orthographic views, and another with ?(n6 k3) perspective views. Our construction can also be used to improve the known lower bounds for the number of silhouette views and for the number of ditinct views from a viewpoint moving along a staight line.
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.
