Add to ORKG金沢大学We are given a polygonal region P with holes and one point q is specified in the region. The problem is how fast we can find the portion of the boundary of P that is visible from q. For this problem an efficient algorithm is presented which runs in time O(n log h) in the worst case and in time O(n plus h log h) if every hole is a convex polygon, where n is the total number of vertices of P and h is the number of holes
In this paper we study parallel algorithms for the Mesh-of-Processors architecture to solve visibili...
This paper provides a gradient search algorithm for finding the maximal visible area polygon (VAP) v...
We present several algorithms for computing the visibility polygon of a simple polygon P of n vertic...
Two points p and q in a simple polygon P are k-visible when the line segment pq crosses the boundary...
AbstractIn this paper, we consider the problem of computing the region visible to a query point loca...
Two points p and q in a simple polygon P are k-crossing visible when the line segment pq crosses the...
AbstractIn this paper, we consider the problem of computing the visibility of a query point inside p...
In this paper, we propose efficient algorithms for computing the complete and weak visibility polygo...
AbstractIn this paper, we consider the problem of computing the region visible to a query point loca...
Let P be a simple polygon with n vertices, and let q∈P be a point in P. Let k∈{0,…,n−1}. A point p∈P...
Abstract. Given a simple polygon P consisting of n vertices, we study the problem of designing space...
Abstract. For a polygon P with n vertices, the vertex guarding problem asks for the minimum subset G...
AbstractIn this paper, we consider the problem of computing the visibility of a query point inside p...
AbstractWe present a method of decomposing a simple polygon that allows the preprocessing of the pol...
We have presented an optimal algorithm for determining the visibility of a polygon from a given edge...
In this paper we study parallel algorithms for the Mesh-of-Processors architecture to solve visibili...
This paper provides a gradient search algorithm for finding the maximal visible area polygon (VAP) v...
We present several algorithms for computing the visibility polygon of a simple polygon P of n vertic...
Two points p and q in a simple polygon P are k-visible when the line segment pq crosses the boundary...
AbstractIn this paper, we consider the problem of computing the region visible to a query point loca...
Two points p and q in a simple polygon P are k-crossing visible when the line segment pq crosses the...
AbstractIn this paper, we consider the problem of computing the visibility of a query point inside p...
In this paper, we propose efficient algorithms for computing the complete and weak visibility polygo...
AbstractIn this paper, we consider the problem of computing the region visible to a query point loca...
Let P be a simple polygon with n vertices, and let q∈P be a point in P. Let k∈{0,…,n−1}. A point p∈P...
Abstract. Given a simple polygon P consisting of n vertices, we study the problem of designing space...
Abstract. For a polygon P with n vertices, the vertex guarding problem asks for the minimum subset G...
AbstractIn this paper, we consider the problem of computing the visibility of a query point inside p...
AbstractWe present a method of decomposing a simple polygon that allows the preprocessing of the pol...
We have presented an optimal algorithm for determining the visibility of a polygon from a given edge...
In this paper we study parallel algorithms for the Mesh-of-Processors architecture to solve visibili...
This paper provides a gradient search algorithm for finding the maximal visible area polygon (VAP) v...
We present several algorithms for computing the visibility polygon of a simple polygon P of n vertic...