Fast computation of generalized Voronoi diagrams using graphics hardware
Proceedings of the 26th annual conference on Computer graphics and interactive techniques
Three-dimensional weak visibility: complexity and applications
Theoretical Computer Science
Hardware-assisted computation of depth contours
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Ray tracing on programmable graphics hardware
Proceedings of the 29th annual conference on Computer graphics and interactive techniques
Digital Elevation Models and TIN Algorithms
Algorithmic Foundations of Geographic Information Systems, this book originated from the CISM Advanced School on the Algorithmic Foundations of Geographic Information Systems
Hardware-Accelerated from-Region Visibility Using a Dual Ray Space
Proceedings of the 12th Eurographics Workshop on Rendering Techniques
A fuzzy approach to visibility maps creation over digital terrains
Fuzzy Sets and Systems - Special issue: Interfaces between fuzzy set theory and interval analysis
Exploring multiple viewshed analysis using terrain features and optimisation techniques
Computers & Geosciences
Visibility maps of segments and triangles in 3d
ICCSA'06 Proceedings of the 6th international conference on Computational Science and Its Applications - Volume Part I
Computing terrain multi-visibility maps for a set of view segments using graphics hardware
ICCSA'06 Proceedings of the 6th international conference on Computational Science and Its Applications - Volume Part I
Finding extremal sets on the GPU
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
Visibility computation on terrain models is an important research topic with many applications in Geographical Information Systems. A multi-visibility map is the subdivision of the domain of a terrain into regions that, according to different criteria, encodes the visibility with respect to a set of view elements. We present an approach for visualising approximated multi-visibility maps of a triangulated terrain corresponding to a set of view elements by using graphics hardware. Our method supports heterogeneous sets of view elements containing points, segments, polygonal chains and polygons and works for weak and strong visibility. Moreover, we are also able to efficiently solve approximated point and polygonal region multi-visibility queries. To illustrate the usefulness of our approach we present results obtained with an implementation of the proposed algorithms.