Combinatorial and Computational Geometry by J. E. Goodman
Combinatorial and Computational Geometry - Table of Contents
- 1. Geometric Approximation via Coresets
- 2. Applications of Graph and Hypergraph Theory in Geometry
- 3. Convex Geometry of Orbits
- 4. The Hadwiger Transversal Theorem for Pseudolines
- 5. Betti Number Bounds, Applications, and Algorithms
- 6. Shelling and the h-Vector of Convex Polytopes
- 7. On the Number of Mutually Touching Cylinders
- 8. Edge-Antipodal Polytopes
- 9. A Conformal Energy for Simplicial Surfaces
- 10. On the Size of Higher-Dimensional Triangulations
- 11. The Carpenter’s Ruler Folding Problem
- 12. A Survey of Folding and Unfolding in Computational Geometry
- 13. On the Rank of a Tropical Matrix
- 14. The Geometry of Biomolecular Solvation
- 15. Inequalities for Zonotopes
- 16. Quasiconvex Programming
- 17. De Concini–Procesi Wonderful Arrangement of Hyperplanes Models
- 18. Thinnest Covering of a Circle by Congruent Circles
- 19. On the Complexity of Visibility Problems
- 20. Cylindrical Partitions of Convex Bodies
- 21. Tropical Halfspaces
- 22. Two Proofs for Sylvester’s Problem
- 23. A Comparison of Five Implementations of 3D Delaunay Tessellation
- 24. The Bernstein Basis and Real Root Isolation
- 25. Extremal Problems Related to the Sylvester–Gallai Theorem
- 26. A Long Noncrossing Path Among Disjoint Segments
- 27. On a Generalization of Schönhardt’s Polyhedron
- 28. On Hadwiger Numbers of Direct Products of Convex Bodies
- 29. Binary Space Partitions: Recent Developments
- 30. The Erdos–Szekeres Theorem: Upper Bounds
- 31. On the Pair-Crossing Number
- 32. Geometric Random Walks: A Survey
What You Will Learn in Combinatorial and Computational Geometry
Combinatorial and Computational Geometry by Jacob E. Goodman, János Pach, and Emo Welzl serves as an essential bridge between pure discrete mathematics and theoretical computer science. Accessing this jacob goodman combinatorial computational geometry pdf allows researchers and graduate students to examine geometric rigidity, visibility graphs, and motion planning algorithms.
The volume comprehensively investigates Helly-type theorems, Voronoi diagrams, packing and covering, and low-dimensional topology. Studying this classic combinatorial computational geometry goodman book equips readers with deep theoretical insight for advanced research in computational complexity and geometric optimization.
Offered as an open academic resource combinatorial computational geometry pdf download, this foundational text remains an indispensable centerpiece for mathematicians, topologists, and theoretical computer scientists.
Book Details & Specifications
Title:
Combinatorial and Computational Geometry by J. E. Goodman
Publisher:
Cambridge University Press
Year:
2005
Pages:
628
Type:
PDF
Language:
English
ISBN-10 #:
0521848628
ISBN-13 #:
978-0521848626
License:
Linked Content Owned by Author
Amazon:
Amazon
About the Author: Jacob E. Goodman
The author Jacob E. Goodman
(1933–2021) was an eminent American mathematician and Professor Emeritus at the City College of New York (CUNY).
Co-founder of the journal Discrete & Computational Geometry, his seminal contributions and co-edited masterwork Combinatorial and Computational Geometry by Jacob E. Goodman permanently shaped modern research in discrete and algorithmic geometry.
Read or Downloadable Combinatorial and Computational Geometry
Free Computational Geometry Books PDF | Algorithm Design Resources