Add to ORKGGiven 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 propose
A multi-visibility map is the subdivision of the domain of a terrain into different regions that, ac...
A terrain is an x-monotone polygonal line in the xy-plane. Two vertices of a terrain are mutually vi...
A polyhedral terrain is the graph of a continuous piecewise linear function defined over the triangl...
Given a 1.5D terrain, i.e., an x -monotone polygonal line in R 2 with n vertices, and 1 m n view...
Given a 1.5D terrain, i.e., an x-monotone polygonal line in R2 with n vertices, and 1 _< m _< n view...
The paper gives an overview of algorithms for the terrain visibility problem. First, a comprehensive...
We study the problem of visibility in polyhedral terrains in the presence of multiple viewpoints. We...
We study the problem of visibility in polyhedral terrains in the presence of multiple viewpoints. We...
This paper describes the design and engineering of algorithms for computing visibility maps on massi...
Let T be a terrain, and let P be a set of points (locations) on its surface. An important problem in...
Given a 2.5D terrain and a query point p on or above it, we want to find the triangles of terrain th...
A terrain is an $x$-monotone polygonal line in the $xy$-plane. Two vertices of a terrain are mutuall...
This paper describes the design and engineering of algo-rithms for computing visibility maps on mass...
In this paper we study several problems concerning the visibility of a polyhedral terrain σ from a p...
Modeling and computing visibility on terrains has useful applications in many fields. The most commo...
A multi-visibility map is the subdivision of the domain of a terrain into different regions that, ac...
A terrain is an x-monotone polygonal line in the xy-plane. Two vertices of a terrain are mutually vi...
A polyhedral terrain is the graph of a continuous piecewise linear function defined over the triangl...
Given a 1.5D terrain, i.e., an x -monotone polygonal line in R 2 with n vertices, and 1 m n view...
Given a 1.5D terrain, i.e., an x-monotone polygonal line in R2 with n vertices, and 1 _< m _< n view...
The paper gives an overview of algorithms for the terrain visibility problem. First, a comprehensive...
We study the problem of visibility in polyhedral terrains in the presence of multiple viewpoints. We...
We study the problem of visibility in polyhedral terrains in the presence of multiple viewpoints. We...
This paper describes the design and engineering of algorithms for computing visibility maps on massi...
Let T be a terrain, and let P be a set of points (locations) on its surface. An important problem in...
Given a 2.5D terrain and a query point p on or above it, we want to find the triangles of terrain th...
A terrain is an $x$-monotone polygonal line in the $xy$-plane. Two vertices of a terrain are mutuall...
This paper describes the design and engineering of algo-rithms for computing visibility maps on mass...
In this paper we study several problems concerning the visibility of a polyhedral terrain σ from a p...
Modeling and computing visibility on terrains has useful applications in many fields. The most commo...
A multi-visibility map is the subdivision of the domain of a terrain into different regions that, ac...
A terrain is an x-monotone polygonal line in the xy-plane. Two vertices of a terrain are mutually vi...
A polyhedral terrain is the graph of a continuous piecewise linear function defined over the triangl...