Abstract. A bisector of two sets is the set of points equidistant to them. Bisectors arise naturally in several areas of computational geometry. We show that bisectors of weakly linearly separable sets in E d share many properties with separating lines. Among these, the bisector of a restricted class of linearly separated sets is a homeomorphic image of the linear separator. We also give necessary and sufficient conditions for the existence of a particular continuous map from a portion of any linear separator to the bisector
In this note, we completely describe the shape of the bisector of two given points in a two-dimensio...
AbstractIt is well known that disjoint closed sets in a Euclidean space may be pushed apart a positi...
Separators in graphs are instrumental in the design of algorithms, having proven to be the key techn...
We prove new theorems which describe a necessary and sufficient condition for linear (strong and non...
We prove new theorems which describe a necessary and sufficient condition for linear (strong and non...
We prove new theorems which describe a necessary and sufficient condition for linear (strong and non...
Consider the following fundamental problem: given two sets R and G of objects positioned in d-dimens...
AbstractGiven linearly inseparable sets R of red points and B of blue points, we consider several me...
AbstractLet S be a convex subset of a Banach space L, and G a subset of L∗. We prove that if G does ...
AbstractLet S be a convex subset of a Banach space L, and G a subset of L∗. We prove that if G does ...
investigating the strength of set existence axioms needed for separable Banach space theory. We show...
AbstractIn this paper we study the separability of two disjoint sets of objects in the plane accordi...
Let γC and γD be two convex distance functions in the plane with convex unit bal...
AbstractIn this paper, algorithms are presented to determine weak and wide linear and spherical sepa...
AbstractWe investigate different separation properties of the diagonal of a space X. Namely, we stud...
In this note, we completely describe the shape of the bisector of two given points in a two-dimensio...
AbstractIt is well known that disjoint closed sets in a Euclidean space may be pushed apart a positi...
Separators in graphs are instrumental in the design of algorithms, having proven to be the key techn...
We prove new theorems which describe a necessary and sufficient condition for linear (strong and non...
We prove new theorems which describe a necessary and sufficient condition for linear (strong and non...
We prove new theorems which describe a necessary and sufficient condition for linear (strong and non...
Consider the following fundamental problem: given two sets R and G of objects positioned in d-dimens...
AbstractGiven linearly inseparable sets R of red points and B of blue points, we consider several me...
AbstractLet S be a convex subset of a Banach space L, and G a subset of L∗. We prove that if G does ...
AbstractLet S be a convex subset of a Banach space L, and G a subset of L∗. We prove that if G does ...
investigating the strength of set existence axioms needed for separable Banach space theory. We show...
AbstractIn this paper we study the separability of two disjoint sets of objects in the plane accordi...
Let γC and γD be two convex distance functions in the plane with convex unit bal...
AbstractIn this paper, algorithms are presented to determine weak and wide linear and spherical sepa...
AbstractWe investigate different separation properties of the diagonal of a space X. Namely, we stud...
In this note, we completely describe the shape of the bisector of two given points in a two-dimensio...
AbstractIt is well known that disjoint closed sets in a Euclidean space may be pushed apart a positi...
Separators in graphs are instrumental in the design of algorithms, having proven to be the key techn...