## Repetitive Hidden Surface Removal for Polyhedra (1995)

Venue: | J. Algorithms |

Citations: | 4 - 0 self |

### BibTeX

@ARTICLE{Pellegrini95repetitivehidden,

author = {Marco Pellegrini},

title = {Repetitive Hidden Surface Removal for Polyhedra},

journal = {J. Algorithms},

year = {1995},

volume = {21},

pages = {541--552}

}

### OpenURL

### Abstract

The repetitive hidden-surface-removal problem can be rephrased as the problem of finding the most compact representation of all views of a polyhedral scene that allows efficient on-line retrieval of a single view. We assume that a polyhedral scene in 3-space is given in advance and is preprocessed off-line into a data structure. Afterwards, the data structure is accessed repeatedly with view-points given on-line and the portions of the polyhedra visible from each view-point are produced on-line. This mode of operation is close to that of real interactive display systems. The main difficulty is to preprocess the scene without knowing the query view-points. In this paper we present a novel approach to this problem. Let n be the total number of edges, vertices and faces of the polyhedral objects and let k be the number of vertices and edges of the image. The main result of this paper is that, using an off-line data structure of size m with n 1+ffl m n 2+ffl , it is possibl...