Approximation algorithms for visibility computation and testing over a terrain

Simple item page
buir.contributor.authorGüdükbay, Uğur
dc.citation.epage59en_US
dc.citation.issueNumber1en_US
dc.citation.spage53en_US
dc.citation.volumeNumber9en_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.date.accessioned2019-02-13T07:58:31Z
dc.date.available2019-02-13T07:58:31Z
dc.date.issued2017en_US
dc.description.abstractGiven a 2.5D terrain and a query point p on or above it, we want to find the triangles of terrain that are visible from p. We present an approximation algorithm to solve this problem. We implement the algorithm and test it on real data sets. The experimental results show that our approximate solution is very close to the exact solution and compared to the other similar works, the computational cost of our algorithm is lower. We analyze the computational complexity of the algorithm. We consider the visibility testing problem where the goal is to test whether a given triangle of the terrain is visible or not with respect to p. We present an algorithm for this problem and show that the average running time of this algorithm is the same as the running time of the case where we want to test the visibility between two query points p and q. We also propose a randomized algorithm for providing an estimate of the portion of the visible region of a terrain for a query point.en_US
dc.description.provenanceSubmitted by Türkan Cesur (cturkan@bilkent.edu.tr) on 2019-02-13T07:58:31Z No. of bitstreams: 1 Approximation_algorithms_for_visibility_computationand_testing_over_a_terrain.pdf: 2455479 bytes, checksum: 042301c441ada3e3db78de725f4864b7 (MD5)en
dc.description.provenanceMade available in DSpace on 2019-02-13T07:58:31Z (GMT). No. of bitstreams: 1 Approximation_algorithms_for_visibility_computationand_testing_over_a_terrain.pdf: 2455479 bytes, checksum: 042301c441ada3e3db78de725f4864b7 (MD5) Previous issue date: 2017en
dc.identifier.doi10.1007/s12518-016-0180-9en_US
dc.identifier.eissn1866-928X
dc.identifier.issn1866-9298
dc.identifier.urihttp://hdl.handle.net/11693/49384
dc.language.isoEnglishen_US
dc.publisherSpringeren_US
dc.relation.isversionofhttp://doi.org/10.1007/s12518-016-0180-9en_US
dc.source.titleApplied Geomaticsen_US
dc.subjectVisibility computationen_US
dc.subjectVisibility counting problemen_US
dc.subjectVisibility testing problemen_US
dc.subjectApproximation algorithmen_US
dc.subjectRandomized algorithmen_US
dc.titleApproximation algorithms for visibility computation and testing over a terrainen_US
dc.typeArticleen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Approximation_algorithms_for_visibility_computationand_testing_over_a_terrain.pdf
Size:
2.34 MB
Format:
Adobe Portable Document Format
Description:
Full printable version
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

Scholarly Publications - Computer Engineering