Check nearby libraries
Buy this book
This is an impressive collection of original research papers in discrete and computational geometry, contributed by many leading researchers in these fields, as a tribute to Jacob E. Goodman and Richard Pollack, two of the `founding fathers' of the area, on the occasion of their 2/3 x 100 birthdays. The topics covered by the 41 papers provide professionals and graduate students with a comprehensive presentation of the state of the art in most aspects of discrete and computational geometry, including geometric algorithms, arrangements, geometric graph theory and quantitative and algorithmic real algebraic geometry, with important connections to algebraic geometry, convexity, polyhedral combinatorics, and the theory of packing, covering, and tiling. The book will serve as an invaluable source of reference in this discipline, and an indispensible component of the library of anyone working in the above areas.
Check nearby libraries
Buy this book
Previews available in: English
Subjects
Geometry, Combinatorial geometry, Data processing, Geometry, data processing, Combinatorial analysis, Mathematics, Distribution (Probability theory), Computational complexity, Discrete groups, Convex and Discrete Geometry, Discrete Mathematics in Computer Science, Probability Theory and Stochastic ProcessesShowing 3 featured editions. View all 3 editions?
Edition | Availability |
---|---|
1
Discrete and Computational Geometry: The Goodman-Pollack Festschrift
2012, Springer London, Limited
in English
3642555667 9783642555664
|
zzzz
Libraries near you:
WorldCat
|
2
Discrete and Computational Geometry: The Goodman-Pollack Festschrift
2012, Springer Berlin / Heidelberg
in English
3642624421 9783642624421
|
zzzz
Libraries near you:
WorldCat
|
3
Discrete and Computational Geometry: The Goodman-Pollack Festschrift (Algorithms and Combinatorics)
August 13, 2003, Springer
Hardcover
in English
- 1 edition
3540003711 9783540003717
|
aaaa
Libraries near you:
WorldCat
|
Book Details
First Sentence
"The arrangement A( ) of a finite collection of curves or surfaces in Rd is the decomposition of the space into relatively open connected cells of dimensions 0,..., d induced by , where each cell is a maximal connected set of points lying in the intersection of a fixed subset of and avoiding all other elements of ."
Classifications
The Physical Object
ID Numbers
Community Reviews (0)
Feedback?September 28, 2024 | Edited by MARC Bot | import existing book |
October 4, 2021 | Edited by ImportBot | import existing book |
February 13, 2019 | Created by MARC Bot | import existing book |