Add to ORKGLet P = {p1, p2,..., pn} and Q = {q1, q2,..., qm} be two simple polygons monotonic in directions θ and ϕ, respectively. It is shown that P and Q are separable with a single translation in at least one of the directions: θ + π / 2, ϕ + π / 2. Furthermore, a direction for carrying out such a translation can be determined in O(m + n) time. This procedure is of use in solving the FIND-PATH problem in robotics. 1
Abstract — We present a polynomial-time algorithm for a special case of the Euclidean traveling sale...
We present an algorithm that computes the complete set of Pareto-optimal coordination strategies for...
AbstractWe introduce a generalization of monotonicity. An n-vertex polygon P is rotationally monoton...
Let P and Q be two disjoint simple polygons having n sides each. We present an algorithm which deter...
We present efficient algorithms for several problems of movable separability in 3-dimensional space....
Given simple polygons P and Q, their separation, denoted by oe(P; Q), is defined to be the minimum d...
We consider the problem of separating a set of polygons by a sequence of translations (one such coll...
AbstractIn this paper, we study the separability in the plane by two criteria: double-wedge separabi...
金沢大学This paper considers the following problem : Given two points u and v in a simple polygon P, div...
AbstractIn this paper we study the problem of finding a set of k directions for a given simple polyg...
In this paper we study the separability in the plane by two criteria: double wedge separability and ...
Given two simple polygons P and Q in the plane, we study the problem of finding a placement ?P of P ...
AbstractLet V = v1, v2, …, vm and W = w1, w2, …, wn be two linearly separable convex polygons whose ...
AbstractIn this paper we study the problem of polygonal separation in the plane, i.e., finding a con...
Let P and Q be two simple polygons in the plane of total complexity n, each of which can be decompos...
Abstract — We present a polynomial-time algorithm for a special case of the Euclidean traveling sale...
We present an algorithm that computes the complete set of Pareto-optimal coordination strategies for...
AbstractWe introduce a generalization of monotonicity. An n-vertex polygon P is rotationally monoton...
Let P and Q be two disjoint simple polygons having n sides each. We present an algorithm which deter...
We present efficient algorithms for several problems of movable separability in 3-dimensional space....
Given simple polygons P and Q, their separation, denoted by oe(P; Q), is defined to be the minimum d...
We consider the problem of separating a set of polygons by a sequence of translations (one such coll...
AbstractIn this paper, we study the separability in the plane by two criteria: double-wedge separabi...
金沢大学This paper considers the following problem : Given two points u and v in a simple polygon P, div...
AbstractIn this paper we study the problem of finding a set of k directions for a given simple polyg...
In this paper we study the separability in the plane by two criteria: double wedge separability and ...
Given two simple polygons P and Q in the plane, we study the problem of finding a placement ?P of P ...
AbstractLet V = v1, v2, …, vm and W = w1, w2, …, wn be two linearly separable convex polygons whose ...
AbstractIn this paper we study the problem of polygonal separation in the plane, i.e., finding a con...
Let P and Q be two simple polygons in the plane of total complexity n, each of which can be decompos...
Abstract — We present a polynomial-time algorithm for a special case of the Euclidean traveling sale...
We present an algorithm that computes the complete set of Pareto-optimal coordination strategies for...
AbstractWe introduce a generalization of monotonicity. An n-vertex polygon P is rotationally monoton...