A Lower Bound for Shallow Partitions

Details A Lower Bound for Shallow Partitions A Lower Bound for Shallow Partitions

2012-01-11

arxiv.org/abs/1201.2267v2

Computer Science

Computational Geometry

6 pages, 1 figure. The result was also obtained independently by Peyman Afshani

Scientific paper

Let P be a planar n-point set. A k-partition of P is a subdivision of P into n/k parts of roughly equal size and a sequence of triangles such that each part is contained in a triangle. A line is k-shallow if it has at most k points of P below it. The crossing number of a k-partition is the maximum number of triangles in the partition that any k-shallow line intersects. We give a lower bound of Omega(log (n/k)/loglog(n/k)) for this crossing number, answering a 20-year old question of Matousek.

Affiliated with

Also associated with

No associations

Rating

A Lower Bound for Shallow Partitions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Lower Bound for Shallow Partitions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Lower Bound for Shallow Partitions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-603817