• About
  • Policies
  • What is openaccess
  • Library
  • Contact
Advanced search
      View Item 
      •   BUIR Home
      • Scholarly Publications
      • Faculty of Engineering
      • Department of Computer Engineering
      • View Item
      •   BUIR Home
      • Scholarly Publications
      • Faculty of Engineering
      • Department of Computer Engineering
      • View Item
      JavaScript is disabled for your browser. Some features of this site may not work without it.

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

      Thumbnail
      View / Download
      1.4 Mb
      Author
      Alipour, S.
      Ghodsi, M.
      Güdükbay, Uğur
      Golkari, M.
      Date
      2014-01
      Source Title
      VISAPP 2014 - Proceedings of the 9th International Conference on Computer Vision Theory and Applications
      Publisher
      IEEE
      Pages
      699 - 704
      Language
      English
      Type
      Conference Paper
      Item Usage Stats
      110
      views
      25
      downloads
      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.
      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
      Permalink
      http://hdl.handle.net/11693/27818
      Published Version (Please cite this version)
      https://ieeexplore.ieee.org/document/7295150
      Collections
      • Department of Computer Engineering 1413
      Show full item record

      Browse

      All of BUIRCommunities & CollectionsTitlesAuthorsAdvisorsBy Issue DateKeywordsTypeDepartmentsThis CollectionTitlesAuthorsAdvisorsBy Issue DateKeywordsTypeDepartments

      My Account

      Login

      Statistics

      View Usage StatisticsView Google Analytics Statistics

      Bilkent University

      If you have trouble accessing this page and need to request an alternate format, contact the site administrator. Phone: (312) 290 1771
      © Bilkent University - Library IT

      Contact Us | Send Feedback | Off-Campus Access | Admin | Privacy