Combinatorial geometry
By: János Pach, Pankaj K. Agarwal.
Contributors: Agarwal, Pankaj K.
Series: Wiley-Interscience series in discrete mathematics and optimization
Publisher: Wiley
Published: 1995
Place of publication: New York
Language: eng
Number of pages: 354
Subjects: Combinatorial geometry.
Description: 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.
Notes: Includes bibliographical references (p. 319-341) and indexes.
"A Wiley-Interscience publication."