Combinatorial and Computational Geometry Contributor(s): Goodman, Jacob E. (Editor), Pach, Janos (Editor), Welzl, Emo (Editor) |
|||
ISBN: 0521848628 ISBN-13: 9780521848626 Publisher: Cambridge University Press
Binding Type: Hardcover - See All Available Formats & Editions Published: August 2005 Annotation: During the past few decades, the gradual merger of Discrete Geometry and the newer discipline of Computational Geometry has provided enormous impetus to mathematicians and computer scientists interested in geometric problems. This volume, which contains 32 papers on a broad range of topics of current interest in the field, is an outgrowth of that synergism. It includes surveys and research articles exploring geometric arrangements, polytopes, packing, covering, discrete convexity, geometric algorithms and their complexity, and the combinatorial complexity of geometric objects, particularly in low dimension. Click for more in this series: Mathematical Sciences Research Institute Publications |
Additional Information |
BISAC Categories: - Computers | Mathematical & Statistical Software - Mathematics | Geometry - General |
Dewey: 516.11 |
LCCN: 2005042199 |
Series: Mathematical Sciences Research Institute Publications |
Physical Information: 1.57" H x 6.16" W x 9.54" L (2.22 lbs) 630 pages |
Features: Bibliography, Illustrated, Table of Contents |
Customer ReviewsSubmit your own review |
To tell a friend about this book, you must Sign In First! |