MetaCartSign in to MyCiteSeer

Include Citations | Advanced Search | Help

Include Citations | Advanced Search | Help

  International Journal of Computational Geometry & Applications c fl World Scientific Publishing Company THE OBJECT COMPLEXITY MODEL FOR HIDDEN-SURFACE REMOVAL

Download:
Download as a PDF | Download as a PS
by Edward F. Grove, T. M. Murali, Jeffrey Scott Vitter
http://www.crl.research.digital.com/who/people/murali/papers/rectangles.ps.gz
Add To MetaCart

Abstract:

We define a new model of complexity, called object complexity, for measuring the performance of hidden-surface removal algorithms. This model is more appropriate for predicting the performance of these algorithms on current graphics rendering systems than the standard measure of scene complexity used in computational geometry. We also consider the problem of determining the set of visible windows in scenes consisting of n axis-parallel windows in R 3. We present an algorithm that runs in optimal \Theta(n log n) time. The algorithm solves in the object complexity model the same problem that Bern 3 addressed in the scene complexity model.

Citations

225 A Subdivision Algorithm for Computer Display of Curved Surfaces – Catmull - 1974
169 A characterization of ten hidden-surface algorithms – Sutherland, Sproull, et al. - 1974
148 Ray shooting and parametric search – Agarwal, Matousek - 1993
116 Visibility Computations in Densely Occluded Polyhedral Environments – Teller - 1992
111 Real-time occlusion culling for models with large occluders – Coorg, Teller - 1997
90 InfiniteReality: A real-time graphics system – Montrym, Baum, et al. - 1997
80 Increasing Update Rates in the Building Walkthrough System with Automatic Model-Space Subdivision and Potentially Visible Set Calculations – Airey - 1990
68 Temporally coherent conservative visibility – Coorg, Teller - 1996
45 Efficient hidden surface removal for objects with small union size – Katz, Overmars, et al. - 1992
45 Worst-case optimal hidden-surface removal – McKenna - 1987
42 Data Structures And Algorithms – Mehlhorn - 1984
36 An efficient output-sensitive hidden-surface removal algorithm and its parallelization – Reif, Sen - 1988
34 On the complexity of computations under varying sets of primitives – Dobkin, Lipton - 1979
24 Hidden surface removal for rectangles – Bern - 1990
16 Quadratic Bounds for Hidden Line Elimination – Devai - 1986
14 A Simplified Technique for Hidden-Line Elimination in Terrains – Preparata, Vitter - 1992
9 Output-sensitive generation of the perspective view of isothetic parallelepipeds – Preparata, Vitter, et al. - 1992
7 Kreveld, "Efficient ray shooting and hidden surface removal – Berg, Halperin, et al. - 1991
5 Generalized hidden surface removal – Berg - 1996