Cutting disjoint disks by straight lines

24Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

Abstract

For k>0 let f(k) denote the minimum integer f such that, for any family of k pairwise disjoint congruent disks in the plane, there is a direction α such that any line having direction α intersects at most f of the disks. We determine the exact asymptotic behavior of f(k) by proving that there are two positive constants d1, d2 such that d1√k √log k≤f(k)≤d2√k √log k. This result has been motivated by problems dealing with the separation of convex sets by straight lines. © 1989 Springer-Verlag New York Inc.

Cite

CITATION STYLE

APA

Alon, N., Katchalski, M., & Pulleyblank, W. R. (1989). Cutting disjoint disks by straight lines. Discrete & Computational Geometry, 4(1), 239–243. https://doi.org/10.1007/BF02187724

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free