Combinatorial geometry

de János Pach · Publicada por primera vez en 1995

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.

Más obras de János Pach

On vertical visibility in arrangements of segments and the queue size in the Bentley-Ottman line sweeping algorithm

1988

The upper envelope of piecewise linear functions and the boundary of a region enclosed by convex plates: combinatorial analysis

1987

New trends in discrete and computational geometry