In this paper, we establish two combinatorial bounds related to the separation problem for sets of n pairwise disjoint translates of convex objects: 1) there exists a line which separates one translate from at least (Formula presented) translates, for some constant c that depends on the “shape” of the translates and 2) there is a function f such that there exists a line with orientation θ or f(θ) which separates one translate from at least (Formula presented) - 4 translates, for any orientation θ (f is defined only by the “shape” of the translate). We also present an O(n log(n + k) + k) time algorithm for finding a translate which can be separated from the maximum number of translates amongst sets of n pairwise disjoint translates of convex k-gons.
CITATION STYLE
Czyzowicz, J., Everett, H., & Robert, J. M. (1994). Separating translates in the plane: Combinatorial bounds and an algorithm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 824 LNCS, pp. 107–118). Springer Verlag. https://doi.org/10.1007/3-540-58218-5_10
Mendeley helps you to discover research relevant for your work.