Using Separating Planes between Objects for Efficient Hidden Surface Removal
Download:
|
|
by Alok Kumar, Vivek Kwatra, Balpreet Singh, Sanjiv Kapoor
http://www.cse.iitd.ernet.in/~skapoor/visualc/paper1.ps.gz
Add To MetaCart
Abstract:
This paper describes a new technique for generation of binary space partition trees representing polyhedral objects and outlines an efficient algorithm for operations such as composition, deletion and motion of objects. We assume a modified version of BSP trees with all the polygon fragments lying at the leaf nodes described in [9]. The efficiency of merging algorithm for two BSP trees depends on the separability of the polyhedras represented by them. We aim to achieve efficiency by use of an ellipsoidal cover of polyhedral object to determine the separating plane between two objects. This paper primarily aims at moving from the domain of polygons to that of objects in dynamic environment. 1
Citations
| 269 | On visible surface generation by a priori tree structures – Fuchs, Kedem, et al. - 1980 |
| 83 | Efficient binary space partitions for hidden-surface removal and solid modeling. Discrete Comput. Geom – Paterson, Yao - 1990 |
| 44 | Optimization of the Binary Space Partition Algorithm (BSP) for Visualization of Dynamic scenes. Computer Graphics Forum(EUROGRAPHICS '90 proceedings – Torres - 1990 |
| 39 | Partitioning Tree Image Representation and Generation from 3D Geometric Models. Graphics Interface ยด92 – Naylor |
| 33 | Interactive Solid Geometry Via Partitioning Trees – Naylor - 1992 |
| 29 | SCULPT: an interactive solid modeling tool – Naylor - 1990 |
| 22 | Computing dynamic changes to BSP trees – Chrysanthou, Slater - 1992 |
| 4 | B.Brand, M.Gilliland and W.Sharp. Study for applying computer generated images to visual simulations – Schamacker - 1969 |
| 4 | Dynamic Binary Space Partitioning for Hidden Surface Removal – Kumar, Kwatra, et al. - 1991 |
