Red-blue separability problems in 3D

Authors:
Ferran Hurtado;Carlos Seara;Saurabh Sethia
Affiliations:
Dpt. Matematica Aplicada 2, Univ. Politécnica de Catalunya, Barcelona, Spain;Dpt. Matematica Aplicada 2, Univ. Politécnica de Catalunya, Barcelona, Spain;Dpt. of Computer Science, Oregon State University, Corvallis, OR
Venue:
ICCSA'03 Proceedings of the 2003 international conference on Computational science and its applications: PartIII
Year:
2003

Citing 7
Cited 2

Minimum polygonal separation

Information and Computation
An optimal algorithm for intersecting line segments in the plane

Journal of the ACM (JACM)
Algorithms for weak and wide separation of sets

Discrete Applied Mathematics
The Union of Convex Polyhedra in Three Dimensions

SIAM Journal on Computing
Computing separating planes for pairs of disjoint polytopes

SCG '85 Proceedings of the first annual symposium on Computational geometry
Convex hulls of finite sets of points in two and three dimensions

Communications of the ACM
Separating objects in the plane by wedges and strips

Discrete Applied Mathematics - Special issue 14th European workshop on computational geometry CG'98 Selected papers

Efficient algorithms for bichromatic separability

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Separability with outliers

ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we study the problems of separability of two disjoint point sets in 3D by multiple criteria extending some notions on separability of two disjoint point sets in the plane.