Abstract

Given a set of points in the plane each colored either red or blue, we find non-self-intersecting geometric spanning cycles of the red points and of the blue points such that each edge of the red spanning cycle is crossed at most three times by the blue spanning cycle and vice-versa.

Full Text
Published version (Free)

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