Combinatorial Geometry
1.5 hrs read
Rate this book:
About This Book
How many objects of a given shape and size can be packed into a large box of fixed volume? Can one plant n trees in an orchard, not all along the same line, so that every line determined by two trees will pass through a third? These questions, raised by Hilbert and Sylvester roughly one hundred years ago, have generated a lot of interest among professional and amateur mathematicians and scientists.
They have led to the birth of a new mathematical discipline with close ties to classical geometry and number theory, and with many applications in coding theory, potential theory, computational geometry, computer graphics, robotics, etc. Combinatorial Geometry offers a self-contained introduction to this rapidly developing field, where combinatorial and probabilistic (counting) methods play a crucial role.
They have led to the birth of a new mathematical discipline with close ties to classical geometry and number theory, and with many applications in coding theory, potential theory, computational geometry, computer graphics, robotics, etc. Combinatorial Geometry offers a self-contained introduction to this rapidly developing field, where combinatorial and probabilistic (counting) methods play a crucial role.
Buy This Book
As an Amazon Associate and Bookshop.org affiliate, BookOrb earns from qualifying purchases.
Write a Review
Sign in to write a review.
More by János Pach
Combinatorial and computationa
Combinatorial and computational geometry
Combinatorial geometry and its
Combinatorial geometry and its algorithmic applications the Alcala lectures
Geometry - Intuitive, Discrete, and Convex
New trends in discrete and computational geometry
New Trends in Intuitive Geometry
On vertical visibility in arrangements of segments and the queue size in the Bentley-Ottman line sweeping algorithm