A faster algorithm to compute the visibility map of a 1.5D terrain
Document typeConference report
Rights accessOpen Access
Given a 1.5D terrain, i.e., an x -monotone polygonal line in R 2 with n vertices, and 1 m n viewpoints placed on some of the terrain vertices, we study the problem of computing the parts of the terrain that are visible from at least one of the viewpoints. We present an algorithm that runs in O ( n + m log m ) time. This improves over a previous algorithm recently proposed
CitationLöffler, M.; Saumell, M.; Silveira, R.I. A faster algorithm to compute the visibility map of a 1.5D terrain. A: European Workshop on Computational Geometry. "Abstracts 30th European Workshop on Computational Geometry". 2014, p. 1-4.