… maximum separability of B and R by using L-shaped separators. First we study a basic version
of this problem where L-shapes … ) time algorithm to solve maximum separability of B and R …

… Geometric separability arises in applications where … For separability in the plane where
the objects to be separated are … Recall that these events occur when the set of maximal blue …

… of this paper since the linear separability of two point sets can be … separability of two point
sets in the plane. Furthermore, in many cases our algorithm can decide the linear separability …

… the separability problem for a family of non-convex rectilinear objects called L-shapes and …
problem for minimum width annulus can be extended to the separability problem for maximum …

… We study separability problems for a set R of red imprecise points and a set B of blue … (which
separate R from B with maximum probability), and maximal separators (which maximize the …

… For separability in the plane, which is the topic of our paper, the following results are known…
maximal (at orientation θ) if there is no point q ∈ B that dominates p. Connecting the maximal …

… the separability problem for a family of non-convex rectilinear objects called L-shapes and
gave … width annulus can be extended to the separability problem for maximum width annulus. …

… We have analyzed 11 L-shapes and 8 T- and Y-shapes of … shape of a filled triangle with
maximal expulsion at the center of … results for the seventh quark separation where the node and …

… to solve since it requires finding the maximum of a possibly high-degree polynomial. In
Section 3 we present exact algorithms for weak separability for linear separators (running in O(n2…

… We also show the separation between various graph classes. … We take the maximum over
all pairs of L-shapes a, b in the input. We can use a 2-dimensional table T(a, b) to store the …