2021/03/14 by Sharareh Alipour, Alipour, Sharareh
Computer Science · Environmental Science · #Computational Geometry (cs.CG) #Computational Geometry and Mesh Generation #Data Management and Algorithms #FOS: Computer and information sciences #Remote Sensing and LiDAR Applications
paper · pdf · doi:10.48550/arxiv.2103.08058
openalex publication_date 2021/03/14 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
For a set S of n disjoint line segments in ℝ2, the visibility counting problem is to preprocess S such that the number of visible segments in S from any query point p can be computed quickly. There have been approximation algorithms for this problem with trade off between space and query time. We propose a new randomized algorithm to compute the exact answer of the problem. For any 00 is an arbitrary constant number.