Add to ORKG金沢大学This paper considers the following problem : Given two points u and v in a simple polygon P, divide P into three parts, locus of points closer to u, that closer to v, and that equidistant from u and v. An O(n**2)-time algorithm is presented where n is the number of vertices of the simple polygon
AbstractThis paper considers the problem of partitioning a planar set of n points into two subsets s...
AbstractThis paper presents an algorithm for convex polygon decomposition around a given set of loca...
We consider the methods of construction simple polygons for a set S of n points and applying them fo...
Given a simple polygon P on n vertices vq,vi,…, vn-i with each edge assigned a non-negative weight W...
Let P and Q be two disjoint simple polygons having n sides each. We present an algorithm which deter...
\u3cp\u3eWe study the problem of cutting a simple polygon with n vertices into two pieces such that ...
Given simple polygons P and Q, their separation, denoted by oe(P; Q), is defined to be the minimum d...
Meisters ’ [Me] Two-Ears Theorem was motivated by the problem of triangulating a simple polygon. In ...
Coordinated Science Laboratory was formerly known as Control Systems LaboratoryJoint Services Electr...
We give polynomial-time approximation algorithms for some geometric separation problems: ffl Given ...
Let P = {p1, p2,..., pn} and Q = {q1, q2,..., qm} be two simple polygons monotonic in directions θ a...
Let M be an m-sided simple polygon and N be an n-sided polygon with holes. In this paper we consider...
Let M be an m-sided simple polygon and N be an n-sided polygon with holes. In this paper we consider...
This paper considers the topic of efficiently triangulating a simple polygon with emphasis on practi...
Given an arbitrary polygon with $n$ vertices, we wish to partition it into $p$ connected pieces of g...
AbstractThis paper considers the problem of partitioning a planar set of n points into two subsets s...
AbstractThis paper presents an algorithm for convex polygon decomposition around a given set of loca...
We consider the methods of construction simple polygons for a set S of n points and applying them fo...
Given a simple polygon P on n vertices vq,vi,…, vn-i with each edge assigned a non-negative weight W...
Let P and Q be two disjoint simple polygons having n sides each. We present an algorithm which deter...
\u3cp\u3eWe study the problem of cutting a simple polygon with n vertices into two pieces such that ...
Given simple polygons P and Q, their separation, denoted by oe(P; Q), is defined to be the minimum d...
Meisters ’ [Me] Two-Ears Theorem was motivated by the problem of triangulating a simple polygon. In ...
Coordinated Science Laboratory was formerly known as Control Systems LaboratoryJoint Services Electr...
We give polynomial-time approximation algorithms for some geometric separation problems: ffl Given ...
Let P = {p1, p2,..., pn} and Q = {q1, q2,..., qm} be two simple polygons monotonic in directions θ a...
Let M be an m-sided simple polygon and N be an n-sided polygon with holes. In this paper we consider...
Let M be an m-sided simple polygon and N be an n-sided polygon with holes. In this paper we consider...
This paper considers the topic of efficiently triangulating a simple polygon with emphasis on practi...
Given an arbitrary polygon with $n$ vertices, we wish to partition it into $p$ connected pieces of g...
AbstractThis paper considers the problem of partitioning a planar set of n points into two subsets s...
AbstractThis paper presents an algorithm for convex polygon decomposition around a given set of loca...
We consider the methods of construction simple polygons for a set S of n points and applying them fo...