Set operations on polyhedra using binary space partitioning trees
SIGGRAPH '87 Proceedings of the 14th annual conference on Computer graphics and interactive techniques
Near real-time shadow generation using BSP trees
SIGGRAPH '89 Proceedings of the 16th annual conference on Computer graphics and interactive techniques
A comparison of three shadow volume algorithms
The Visual Computer: International Journal of Computer Graphics
A procedure for generation of three-dimensional half-toned computer graphics presentations
Communications of the ACM
Hidden surface removal using polygon area sorting
SIGGRAPH '77 Proceedings of the 4th annual conference on Computer graphics and interactive techniques
Shadow algorithms for computer graphics
SIGGRAPH '77 Proceedings of the 4th annual conference on Computer graphics and interactive techniques
IEEE Computer Graphics and Applications
Near real-time shaded display of rigid objects
SIGGRAPH '83 Proceedings of the 10th annual conference on Computer graphics and interactive techniques
SIGGRAPH '78 Proceedings of the 5th annual conference on Computer graphics and interactive techniques
On visible surface generation by a priori tree structures
SIGGRAPH '80 Proceedings of the 7th annual conference on Computer graphics and interactive techniques
| Hi-index | 0.00 |
Presents a fast shadow generation algorithm for a large number of convex polyhedra (objects) in a 3D scene based on the concept of characteristic views (CVs). The concept of CVs is that the infinite possible views of a 3D polyhedron can be grouped into a finite number of classes which have the same visible polygons from some reference points (i.e. viewpoints or point light sources). The space can be partitioned into subspaces in which all reference points have the same object ordering. Basically, object-precision hidden surface removal algorithms and object-precision shadow generation algorithms are the same except for the reference point. The shadow volume binary space partitioning (SVBSP) tree algorithm is known to be efficient in a static environment in which the point light source can be changed. However, if a scene consists of many objects and each object consists of many polygons, the time complexity for generating and traversing the SVBSP tree increases rapidly because the SVBSP tree algorithm deals with polygons which are components of objects. Furthermore, the SYBSP tree algorithm suffers from polygon-splitting problems resulting in a high cost as the number of polygons increases. Our approach is object-oriented in the sense that an object is used as the basic unit and polygons can be considered as components of the associated object. For all light source positions, the object ordering for shadow generation is determined at the preprocessing stage. At run-time, the shadow detection algorithm is executed and, if necessary, shadow fragments are generated.