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. Afterward, the data structure is accessed repeatedly with viewpoints given on-line and the portions of the polyhedra visible from each viewpoint 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 viewpoints. 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 1q โ F m F n 2q โ , it is pos-ลฝ sible to answer on-line hidden-surface-removal queries in time O k log ร 1q โ 1r2 4. n q min n log n, kn rm , when the scene is composed of c-oriented polyhedra. This data structure allows dynamic insertion and deletion of polyhedral objects. The polyhedra may intersect and may have cycles in the dominance relation. We also improve worst-case time and storage bounds for the repetitive hidden surface removal problem when the polyhedral scene is composed of unrestricted polyhedra.