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, study of arrangements, geometric graph theory, quantitative and algorithmic real algebraic geometry, with important connections to algebraic geometry, convexity, polyhedral combinatorics, the theory of packing, covering, and tiling. The book serves as an invaluable source of reference in this discipline.
Book Description
Editorial Reviews
From the Back Cover
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.
Product Details
Would you like to update product info or give feedback on images?
|
Customer Reviews
|
There are no customer reviews yet.
|
|||
|
Video reviews
|
Inside This Book
(learn more)
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 . Read the first page Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
halving triangles, boundary sample points, interior sample points, convex partition number, cross ratio phases, partial match problem, affine point configuration, abstract order types, one hinge point, cocone neighbor, crosses aff, infeasible arrangement, underlying abstract polyhedron, equal spherical balls, turnpike problem, turnpike reconstruction, cylindrical cell decomposition, magic arrays, greedy flip algorithm, one red point, coinciding vertices, balanced subdivisions, central simplex, cyclic chromatic number, weighted square distance Key Phrases - Capitalized Phrases (CAPs): (learn more)
New York, Discrete Comput, Theory Ser, Cambridge University Press, Theory Appl, Fejes Tóth, London Math, Boca Raton, Department of Mathematics, North Holland, Symbolic Comput, Academic Press, Discrete Appl, Rotating Convex Bodies, Charles University, Dense Packings of Congruent Circles, Generalized Lower Bound Theorem, Handbook of Convex Geometry, Hungarian Academy of Sciences, Las Vergnas, Nearest Neighbor Lower Bound, Springer Verlag, Stony Brook, Zvi Schur, Acknowledgments Work New!
Books on Related Topics | Concordance | Text Stats Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Back Cover | Surprise Me!
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 . Read the first page Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
halving triangles, boundary sample points, interior sample points, convex partition number, cross ratio phases, partial match problem, affine point configuration, abstract order types, one hinge point, cocone neighbor, crosses aff, infeasible arrangement, underlying abstract polyhedron, equal spherical balls, turnpike problem, turnpike reconstruction, cylindrical cell decomposition, magic arrays, greedy flip algorithm, one red point, coinciding vertices, balanced subdivisions, central simplex, cyclic chromatic number, weighted square distance Key Phrases - Capitalized Phrases (CAPs): (learn more)
New York, Discrete Comput, Theory Ser, Cambridge University Press, Theory Appl, Fejes Tóth, London Math, Boca Raton, Department of Mathematics, North Holland, Symbolic Comput, Academic Press, Discrete Appl, Rotating Convex Bodies, Charles University, Dense Packings of Congruent Circles, Generalized Lower Bound Theorem, Handbook of Convex Geometry, Hungarian Academy of Sciences, Las Vergnas, Nearest Neighbor Lower Bound, Springer Verlag, Stony Brook, Zvi Schur, Acknowledgments Work New!
Books on Related Topics | Concordance | Text Stats Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Back Cover | Surprise Me!
Citations (learn more)
This book cites 69
books:
See all 69 books this book cites
- Handbook of Discrete and Computational Geometry, Second Edition (Discrete Mathematics and Its Applications) by Jacob E. Goodman on 7 pages
- Discrete and Computational Geometry by Jin Akiyama on 5 pages
- Handbook of Computational Geometry by J.R. Sack on 4 pages
- Computational Geometry: Algorithms and Applications, Second Edition by Mark de Berg on page 22, page 135, and page 272
- Combinatorial Geometry by J?nos Pach on page 23, page 300, and page 569
See all 69 books this book cites
Books on Related Topics
(learn more)
|
Tag this product(What's this?)Think of a tag as a keyword or label you consider is strongly related to this product.
Tags will help all customers organize and find favorite items. |
Sell a Digital Version of This Book in the Kindle Store
If you are a publisher or author and hold the digital rights to a book, you can sell a digital version of it in our Kindle Store.
Learn more
Customer Discussions
|
This product's forum
Active discussions in related forums
Search Customer Discussions
|
Related forums
|
