An approximation algorithm for computing the visibility region of a point on a terrain and visibility testing

Date
2014-01
Advisor
Instructor
Source Title
VISAPP 2014 - Proceedings of the 9th International Conference on Computer Vision Theory and Applications
Print ISSN
Electronic ISSN
Publisher
IEEE
Volume
Issue
Pages
699 - 704
Language
English
Type
Conference Paper
Journal Title
Journal ISSN
Volume Title
Abstract

Given a terrain and a query point p on or above it, we want to count the number of triangles of terrain that are visible from p. We present an approximation algorithm to solve this problem. We implement the algorithm and then we run it on the real data sets. The experimental results show that our approximation solution is very close to the real solution and compare to the other similar works, the running time of our algorithm is better than their algorithm. The analysis of time complexity of algorithm is also presented. Also, we consider visibility testing problem, where the goal is to test whether p and a given triangle of train are visible or not. We propose an algorithm for this problem and show that the average running time of this algorithm will be the same as running time of the case where we want to test the visibility between two query point p and q.

Course
Other identifiers
Book Title
Keywords
Approximation algorithm, Computational geometry, Terrain, Visibility, Computational complexity, Computational geometry, Landforms, Problem solving, Visibility, Approximation solution, Average running time, Number of triangles, Real data sets, Real solutions, Running time, Terrain, Time complexity, Approximation algorithms
Citation
Published Version (Please cite this version)