2000 character limit reached
Geometric Spanning Cycles in Bichromatic Point Sets
Published 15 Feb 2015 in cs.CG | (1502.04328v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.