Add to ORKG金沢大学The following problem is considered: Given a rectilinear simple polygon P and a point q in its exterior; find the region that is reachable from q along orthogonal paths with at most k bends. We present an efficient algorithm which runs in O(kn) time, where n is the number of vertices
We consider the problem of finding a bounded-curvature path in the plane from one configuration αs t...
We consider the rooted orienteering problem: Given a set P of n points in the plane, a starting poin...
AbstractThe problem of finding a rectilinear minimum bend path (RMBP) between two designated points ...
金沢大学Among the most fundamental problems in the layout design of an integrated circuit is the followi...
Two points p and q in a simple polygon P are k-visible when the line segment pq crosses the boundary...
Two points p and q in a simple polygon P are k-crossing visible when the line segment pq crosses the...
金沢大学We are given a polygonal region P with holes and one point q is specified in the region. The pro...
We give an algorithm to compute a (Euclidean) shortest path in a polygon with h holes and a total o...
Let B be a point robot moving in the plane, whose path is constrained to forward motions with curvat...
Let B be a point robot moving in the plane, whose path is constrained to forward motions with curvat...
AbstractLet B be a point robot moving in the plane, whose path is constrained to forward motions wit...
Abstract. We study a hard geometric problem. Given n points in the plane and a positive integer k, t...
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...
金沢大学We consider the following two problems: (P1) We are given a rectilinear simple polygon P with n ...
AbstractWe show that it is NP-hard to find a polygonal path π with a minimum number of turns inside ...
We consider the problem of finding a bounded-curvature path in the plane from one configuration αs t...
We consider the rooted orienteering problem: Given a set P of n points in the plane, a starting poin...
AbstractThe problem of finding a rectilinear minimum bend path (RMBP) between two designated points ...
金沢大学Among the most fundamental problems in the layout design of an integrated circuit is the followi...
Two points p and q in a simple polygon P are k-visible when the line segment pq crosses the boundary...
Two points p and q in a simple polygon P are k-crossing visible when the line segment pq crosses the...
金沢大学We are given a polygonal region P with holes and one point q is specified in the region. The pro...
We give an algorithm to compute a (Euclidean) shortest path in a polygon with h holes and a total o...
Let B be a point robot moving in the plane, whose path is constrained to forward motions with curvat...
Let B be a point robot moving in the plane, whose path is constrained to forward motions with curvat...
AbstractLet B be a point robot moving in the plane, whose path is constrained to forward motions wit...
Abstract. We study a hard geometric problem. Given n points in the plane and a positive integer k, t...
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...
金沢大学We consider the following two problems: (P1) We are given a rectilinear simple polygon P with n ...
AbstractWe show that it is NP-hard to find a polygonal path π with a minimum number of turns inside ...
We consider the problem of finding a bounded-curvature path in the plane from one configuration αs t...
We consider the rooted orienteering problem: Given a set P of n points in the plane, a starting poin...
AbstractThe problem of finding a rectilinear minimum bend path (RMBP) between two designated points ...