Visibility Resolution with Polar Diagrams
Visibility determination is an essential topic in computer graphics when visualizing large scenes. This problem can be addressed using many different techniques, but most of them discard obtaining an exact visible set because it is more time consuming compared with the solution provided by the graph...
| Autores: | , |
|---|---|
| Formato: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2013 |
| País: | España |
| Recursos: | Universidad de Jaén |
| Repositorio: | RUJA. Repositorio Institucional de la Producción Científica de la Universidad de Jaén |
| OAI Identifier: | oai:dnet:ruja________::a1ca264e8c1ba0aa129732aea1a1a95e |
| Acesso em linha: | https://www.naturalspublishing.com/files/published/7j5n1b80h12iov.pdf https://hdl.handle.net/10953/7913 |
| Access Level: | acceso abierto |
| Palavra-chave: | Computer Graphics, Visibility Map, Ray-shooting technique 1203.04, 3305.37, 1203.26 |
| Resumo: | Visibility determination is an essential topic in computer graphics when visualizing large scenes. This problem can be addressed using many different techniques, but most of them discard obtaining an exact visible set because it is more time consuming compared with the solution provided by the graphics hardware. However the problem remains if the scenes must be visualized in a mobile device and the visible scene must be transmitted via the Internet. In this paper we introduce a new approach based on ray shooting for obtaining an exact visibility set in polygonal scenes in R2 and prism-shaped objects in R3. In both cases the scene is divided into disjoint regions using the polar diagram, a plane partition based on angle preprocessing. The polar diagram allows to improve computation times while ensuring accurate results in these scenes. |
|---|