What do you think?
Rate this book
The Maximum Number of Ways to Stab N Convex Non-Intersecting Objects in the Plane 2n-2
Excerpt from The Maximum Number of Ways to Stab N Convex Non-Intersecting Objects in the Plane 2n-2
We derive the tight upper bound on the maximum number of geometric permuta tions by proving a sequence of three lemmas. First, we introduce a few definitions.
We derive the tight upper bound on the maximum number of geometric permuta tions by proving a sequence of three lemmas. First, we introduce a few definitions.
17 pages, Paperback
Published August 24, 2018
Ratings & Reviews
Friends & Following
Create a free account to discover what your friends think of this book!
Community Reviews
No one has reviewed this book yet.