A dynamic screen technique for shaded graphics display of slice-represented objects
Computer Vision, Graphics, and Image Processing
Computer graphics: principles and practice (2nd ed.)
Computer graphics: principles and practice (2nd ed.)
A solution to the hidden surface problem
ACM '72 Proceedings of the ACM annual conference - Volume 1
On visible surface generation by a priori tree structures
SIGGRAPH '80 Proceedings of the 7th annual conference on Computer graphics and interactive techniques
Shadow volume BSP trees for computation of shadows in dynamic scenes
I3D '95 Proceedings of the 1995 symposium on Interactive 3D graphics
Computer-Aided Design
Layer-Based Representation of Polyhedrons for Point Containment Tests
IEEE Transactions on Visualization and Computer Graphics
The BOXEL framework for 2.5D data with applications to virtual drivethroughs and ray tracing
Computational Geometry: Theory and Applications
Technical section: Point in solid strategies
Computers and Graphics
Visibility computations - scanline algorithms and techniques
ICCSA'07 Proceedings of the 2007 international conference on Computational science and Its applications - Volume Part II
| Hi-index | 0.00 |
A technique for displaying binary space partitioning (BSP) trees that is faster than the usual back-to-front display method is presented. By combining polygon scan-conversion with a dynamic screen data structure, the technique, a front-to-back approach, provides significant speedup in the display time of polygonal scenes that depend on BSP trees, especially in cases where the number of polygons is large. This speedup is confirmed by applying the technique to randomly generated triangles.