Exact From-Region Visibility Culling
| dc.contributor.author | Nirenstein, S. | en_US |
| dc.contributor.author | Blake, E. | en_US |
| dc.contributor.author | Gain, J. | en_US |
| dc.contributor.editor | P. Debevec and S. Gibson | en_US |
| dc.date.accessioned | 2014-01-27T14:06:15Z | |
| dc.date.available | 2014-01-27T14:06:15Z | |
| dc.date.issued | 2002 | en_US |
| dc.description.abstract | To pre-process a scene for the purpose of visibility culling during walkthroughs it is necessary to solve visibility from all the elements of a finite partition of viewpoint space. Many conservative and approximate solutions have been developed that solve for visibility rapidly. The idealised exact solution for general 3D scenes has often been regarded as computationally intractable. Our exact algorithm for finding the visible polygons in a scene from a region is a computationally tractable pre-process that can handle scenes of the order of millions of polygons. The essence of our idea is to represent 3-D polygons and the stabbing lines connecting them in a 5-D Euclidean space derived from Plücker space and then to perform geometric subtractions of occluded lines from the set of potential stabbing lines.We have built a query architecture around this query algorithm that allows for its practical application to large scenes. We have tested the algorithm on two different types of scene: despite a large constant computational overhead, it is highly scalable, with a time dependency close to linear in the output produced. | en_US |
| dc.description.seriesinformation | Eurographics Workshop on Rendering | en_US |
| dc.identifier.isbn | 1-58113-534-3 | en_US |
| dc.identifier.issn | 1727-3463 | en_US |
| dc.identifier.uri | https://doi.org/10.2312/EGWR/EGWR02/191-202 | en_US |
| dc.publisher | The Eurographics Association | en_US |
| dc.title | Exact From-Region Visibility Culling | en_US |
Files
Original bundle
1 - 1 of 1