Cutting a Set of Disks by a Line with Leaving Many Intact Disks in Both Sides

Authors: Maehara H.; Oshiro A.

Source: Journal of Combinatorial Theory, Series A, Volume 90, Number 1, April 2000 , pp. 235-240(6)

Buy & download fulltext article:

Price: $52.63 plus tax (Refund Policy)

Abstract:

Cut by a line the union of given disjoint disks in the plane so that both sides of the line contain many intact disks. At least how many intact disks can we leave in either side? It is proved that there is a family of infinitely many disjoint disks in the plane for which every line has a side that contains at most one intact disk. On the other hand, for any family of n disjoint disks, there is a circle C such that both the interior and the exterior of C contain n/4-o(n) intact disks. Copyright 2000 Academic Press.

Language: English

Document Type: Miscellaneous

Affiliations: College of Education, Ryukyu University, Okinawa, 903-0213, Japan

Publication date: 2000-04-01