Given two simple polygons, the Minimal Vertex Nested Polygon Problem is one of finding a polygon nested between the given polygons having the minimum number of vertices. In this paper, we suggest efficient approximate algorithms for interesting special cases of the above using the shortest-path finding graph algorithms
We show that the shadow vertex algorithm can be used to compute a short path between a given pair of...
The two-watchman route problem is that of computing a pair of closed tours in an environment so that...
The minimum vertex distance between two separable convex polygons is found by an optimal algorithm w...
Given two simple polygons, the Minimal Vertex Nested Polygon Problem is one of finding a polygon nes...
AbstractWe consider the problem of finding a polygon nested between two given convex polygons that h...
Abstract:- The problem of minimizing the number of vertex-guards necessary to cover a given simple p...
AbstractThe minimum vertex cover problem is a basic combinatorial optimization problem. Given an und...
Let P be a simple polygon and let f(u i ; u 0 i )g be m pairs of distinct vertices of P where for ...
Two algorithms are presented for computing shortest paths in the plane avoiding convex polygonal obs...
We give an algorithm to compute a (Euclidean) shortest path in a polygon with h holes and a total o...
The bridge problem considers k disjoint regions in the plane or space and tries to place k -1 optim...
We present an approximation algorithm that, given a simple, possibly nonconvex polyhedron P with n v...
Given simple polygons P and Q, their separation, denoted by oe(P; Q), is defined to be the minimum d...
In this paper we propose two linear time algorithms for computing the shortest path tree rooted at a...
Let P be a path between two points s and t in a polygonal subdivision T with obstacles and weighted ...
We show that the shadow vertex algorithm can be used to compute a short path between a given pair of...
The two-watchman route problem is that of computing a pair of closed tours in an environment so that...
The minimum vertex distance between two separable convex polygons is found by an optimal algorithm w...
Given two simple polygons, the Minimal Vertex Nested Polygon Problem is one of finding a polygon nes...
AbstractWe consider the problem of finding a polygon nested between two given convex polygons that h...
Abstract:- The problem of minimizing the number of vertex-guards necessary to cover a given simple p...
AbstractThe minimum vertex cover problem is a basic combinatorial optimization problem. Given an und...
Let P be a simple polygon and let f(u i ; u 0 i )g be m pairs of distinct vertices of P where for ...
Two algorithms are presented for computing shortest paths in the plane avoiding convex polygonal obs...
We give an algorithm to compute a (Euclidean) shortest path in a polygon with h holes and a total o...
The bridge problem considers k disjoint regions in the plane or space and tries to place k -1 optim...
We present an approximation algorithm that, given a simple, possibly nonconvex polyhedron P with n v...
Given simple polygons P and Q, their separation, denoted by oe(P; Q), is defined to be the minimum d...
In this paper we propose two linear time algorithms for computing the shortest path tree rooted at a...
Let P be a path between two points s and t in a polygonal subdivision T with obstacles and weighted ...
We show that the shadow vertex algorithm can be used to compute a short path between a given pair of...
The two-watchman route problem is that of computing a pair of closed tours in an environment so that...
The minimum vertex distance between two separable convex polygons is found by an optimal algorithm w...
DOI
Add to ORKG