About “Discrete and computational geometry”
This collection of original research papers in discrete and computational geometry is a tribute to Jacob E. Goodman and Richard Pollack on the occasion of their birthdays. Its 41 papers cover geometric algorithms, arrangements, geometric graph theory, and algorithmic real algebraic geometry, with connections to algebraic geometry, convexity, polyhedral combinatorics, and packing, covering, and tiling.
Book details
- First published
- 2003
- Pages
- 853
Frequently asked questions
How many pages is Discrete and computational geometry?
Discrete and computational geometry by Martin Grötschel has 853 pages.