The Object Complexity Model for Hidden-Surface Removal

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 ℝ3. We present an algorithm that runs in optimal Θ(n log n) time. The algorithm solves in the object complexity model the same problem that Bern3 addressed in the scene complexity model.

[1]  Marshall W. Bern,et al.  Hidden surface removal for rectangles , 1988, SCG '88.

[2]  Jirí Matousek,et al.  Ray Shooting and Parametric Search , 1993, SIAM J. Comput..

[3]  John M. Airey,et al.  Increasing update rates in the building walkthrough system with automatic model-space subdivision and potentially visible set calculations , 1990 .

[4]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[5]  Micha Sharir,et al.  Efficient Hidden Surface Removal for Objects with Small Union Size , 1992, Comput. Geom..

[6]  Ferenc Dévai,et al.  Quadratic bounds for hidden line elimination , 1986, SCG '86.

[7]  Micha Sharir,et al.  Efficient hidden surface removal for objects with small union size , 1991, SCG '91.

[8]  John S. Montrym,et al.  InfiniteReality: a real-time graphics system , 1997, SIGGRAPH.

[9]  Prof. Dr. Kurt Mehlhorn,et al.  Data Structures and Algorithms 3 , 2012, EATCS Monographs on Theoretical Computer Science.

[10]  Edwin Earl Catmull,et al.  A subdivision algorithm for computer display of curved surfaces. , 1974 .

[11]  Michael McKenna.  Worst-case optimal hidden-surface removal , 1987, TOGS.

[12]  Mark de Berg,et al.  Efficient ray shooting and hidden surface removal , 1991, SCG '91.

[13]  Seth J. Teller,et al.  Temporally coherent conservative visibility , 1999, Comput. Geom..

[14]  Jeffrey Scott Vitter,et al.  A Simplified Technique for Hidden-Line Elimination in Terrains , 1992, STACS.

[15]  John H. Reif,et al.  An efficient output-sensitive hidden surface removal algorithm and its parallelization , 1988, SCG '88.

[16]  Richard J. Lipton,et al.  On the Complexity of Computations under Varying Sets of Primitives , 1975, J. Comput. Syst. Sci..

[17]  Thomas Ertl,et al.  Computer Graphics - Principles and Practice, 3rd Edition , 2014 .

[18]  Seth Teller,et al.  Visibility Computations in Densely Occluded Polyhedral Environments , 1992 .

[19]  Mark de Berg.  Generalized hidden surface removal , 1993, SCG '93.

[20]  John Beidler,et al.  Data Structures and Algorithms , 1996, Wiley Encyclopedia of Computer Science and Engineering.

[21]  Seth J. Teller,et al.  Real-time occlusion culling for models with large occluders , 1997, SI3D.