Combinatorial and Computational Geometry (Mathematical Sciences Research Institute Publications, Series Number 52)
ISBN-13:
9780521178396
ISBN-10:
0521178398
Edition:
1
Author:
Janos Pach, Jacob E. Goodman, Emo Welzl
Publication date:
2011
Publisher:
Cambridge University Press
Format:
Paperback
630 pages
Category:
Mathematical & Statistical
,
Software
,
Enterprise Applications
,
Geometry & Topology
,
Mathematics
FREE US shipping
Book details
ISBN-13:
9780521178396
ISBN-10:
0521178398
Edition:
1
Author:
Janos Pach, Jacob E. Goodman, Emo Welzl
Publication date:
2011
Publisher:
Cambridge University Press
Format:
Paperback
630 pages
Category:
Mathematical & Statistical
,
Software
,
Enterprise Applications
,
Geometry & Topology
,
Mathematics
Summary
Combinatorial and Computational Geometry (Mathematical Sciences Research Institute Publications, Series Number 52) (ISBN-13: 9780521178396 and ISBN-10: 0521178398), written by authors
Janos Pach, Jacob E. Goodman, Emo Welzl, was published by Cambridge University Press in 2011.
With an overall rating of 3.5 stars, it's a notable title among other
Mathematical & Statistical
(Software, Enterprise Applications, Geometry & Topology, Mathematics) books. You can easily purchase or rent Combinatorial and Computational Geometry (Mathematical Sciences Research Institute Publications, Series Number 52) (Paperback) from BooksRun,
along with many other new and used
Mathematical & Statistical
books
and textbooks.
And, if you're looking to sell your copy, our current buyback offer is $0.3.
Description
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.
We would LOVE it if you could help us and other readers by reviewing the book
Book review
Congratulations! We have received your book review.
{user}
{createdAt}
by {truncated_author}