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

Simple item page
buir.contributor.authorGüdükbay, Uğur
dc.citation.epage704en_US
dc.citation.spage699en_US
dc.contributor.authorAlipour, S.en_US
dc.contributor.authorGhodsi, M.en_US
dc.contributor.authorGüdükbay, Uğuren_US
dc.contributor.authorGolkari, M.en_US
dc.coverage.spatialLisbon, Portugal
dc.date.accessioned2016-02-08T12:02:20Z
dc.date.available2016-02-08T12:02:20Z
dc.date.issued2014-01en_US
dc.departmentDepartment of Computer Engineeringen_US
dc.descriptionDate of Conference: 5-8 Jan. 2014
dc.descriptionConference name: 2014 International Conference on Computer Vision Theory and Applications (VISAPP)
dc.description.abstractGiven 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.en_US
dc.identifier.urihttp://hdl.handle.net/11693/27818
dc.language.isoEnglishen_US
dc.publisherIEEE
dc.relation.isversionofhttps://ieeexplore.ieee.org/document/7295150
dc.source.titleVISAPP 2014 - Proceedings of the 9th International Conference on Computer Vision Theory and Applicationsen_US
dc.subjectApproximation algorithmen_US
dc.subjectComputational geometryen_US
dc.subjectTerrainen_US
dc.subjectVisibilityen_US
dc.subjectComputational complexityen_US
dc.subjectComputational geometryen_US
dc.subjectLandformsen_US
dc.subjectProblem solvingen_US
dc.subjectVisibilityen_US
dc.subjectApproximation solutionen_US
dc.subjectAverage running timeen_US
dc.subjectNumber of trianglesen_US
dc.subjectReal data setsen_US
dc.subjectReal solutionsen_US
dc.subjectRunning timeen_US
dc.subjectTerrainen_US
dc.subjectTime complexityen_US
dc.subjectApproximation algorithmsen_US
dc.titleAn approximation algorithm for computing the visibility region of a point on a terrain and visibility testingen_US
dc.typeConference Paperen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
An Approximation Algorithm for Computing the Visibility Region of a.pdf
Size:
1.41 MB
Format:
Adobe Portable Document Format
Description:
Full Printable Version
Download

Collections

Department of Computer Engineering