Abstract

Let n non-overlapping convex discs be contained in a triangle T. It is proved that T can be partitioned into 6n-5 subtriangles such that the interior of each subtriangle intersects at most one of the discs.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call