A Space-Optimal Hidden Surface Removal Algorithm for Iso-Oriented Rectangles

Details A Space-Optimal Hidden Surface Removal Algorithm for Iso-Oriented Rectangles A Space-Optimal Hidden Surface Removal Algorithm for Iso-Oriented Rectangles

2011-09-02

arxiv.org/abs/1109.0389v1

Computer Science

Computational Geometry

Scientific paper

We investigate the problem of finding the visible pieces of a scene of objects from a specified viewpoint. In particular, we are interested in the design of an efficient hidden surface removal algorithm for a scene comprised of iso-oriented rectangles. We propose an algorithm where given a set of $n$ iso-oriented rectangles we report all visible surfaces in $O((n+k)\log n)$ time and linear space, where $k$ is the number of surfaces reported. The previous best result by Bern, has the same time complexity but uses $O(n\log n)$ space.

Affiliated with

Also associated with

No associations

Rating

A Space-Optimal Hidden Surface Removal Algorithm for Iso-Oriented Rectangles does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Space-Optimal Hidden Surface Removal Algorithm for Iso-Oriented Rectangles, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Space-Optimal Hidden Surface Removal Algorithm for Iso-Oriented Rectangles will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-687628