Sciweavers

Share
COMBINATORICA
2008

The combinatorial encoding of disjoint convex sets in the plane

11 years 5 months ago
The combinatorial encoding of disjoint convex sets in the plane
We introduce a new combinatorial object, the double-permutation sequence, and use it to encode a family of mutually disjoint compact convex sets in the plane in a way that captures many of its combinatorial properties. We use this encoding to give a new proof of the Edelsbrunner-Sharir theorem that a collection of n compact convex sets in the plane cannot be met by straight lines in more than 2n
Jacob E. Goodman, Richard Pollack
Added 09 Dec 2010
Updated 09 Dec 2010
Type Journal
Year 2008
Where COMBINATORICA
Authors Jacob E. Goodman, Richard Pollack
Comments (0)
books