Please use this identifier to cite or link to this item:
|Title:||A faster algorithm to compute the visibility map of a 1.5D terrain|
|Abstract:||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.|
|Appears in Collections:||CIDMA - Comunicações|
OGTCG - Comunicações
Files in This Item:
|terrains-eurocg14-final.pdf||article||270.66 kB||Adobe PDF||View/Open|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.