Quasi-parallel segments and characterization of unique bichromatic matchings
Andrei Asinowski, Tillmann Miltzow, Günter Rote
Journal of Computational Geometry · 2015
doi:10.20382/jocg.v6i1a8 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
Given <em>n</em> red and <em>n</em> blue points in general position in the plane, it is well-known that there is a perfect matching formed by non-crossing line segments. We characterize the bichromatic point sets which admit exactly one non-crossing matching. We give several geometric descriptions of such sets, and find an <em>O</em>(<em>n</em> log <em>n</em>) algorithm that checks whether a given bichromatic set has this property.
Abstract licence: CC BY
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.