Title | Discrete and Computational Geometry [electronic resource] : The Goodman-Pollack Festschrift / edited by Boris Aronov, Saugata Basu, Jรกnos Pach, Micha Sharir |
---|---|

Imprint | Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2003 |

Connect to | http://dx.doi.org/10.1007/978-3-642-55566-4 |

Descript | XII, 853 p. online resource |

SUMMARY

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

CONTENT

On the Complexity of Many Faces in Arrangements of Pseudo-Segments and of Circles -- Polyhedral Cones of Magic Cubes and Squares -- of the Polygons -- Computing the Hausdorff Distance of Geometric Patterns and Shapes -- A Sum of Squares Theorem for Visibility Complexes and Applications -- On the Reflexivity of Point Sets -- Geometric Permutations of Large Families of Translates -- Integer Points in Rotating Convex Bodies -- Complex Matroids ยจC Phirotopes and Their Realizations in Rank -- Covering the Sphere by Equal Spherical Balls -- Lower Bounds for High Dimensional Nearest Neighbor Searchand Related Problems -- A Turยดan-type Extremal Theory of Convex Geometric Graphs -- Relaxation -- A Lower Bound on the Complexity of Approximate Nearest-NeighborSearching on the Hamming -- Detecting Undersampling in Surface Reconstruction -- A Survey of the Hadwiger-Debrunner (p, q)-problem -- Surface Reconstruction by Wrapping Finite Sets in Space -- Infeasibility of Systems of Halfspaces -- Complete Combinatorial Generation of Small Point Configurations and Hyperplane -- Relative Closure and the Complexity of Pfaffian Elimination -- Are Your Polyhedra the Same as My Polyhedra -- Some Algorithms Arising in the Proof of the Kepler Conjecture -- The Minimal Number of Triangles Needed to Span a Polygon Embedded in Rd -- Jacobi Decomposition and Eigenvalues of Symmetric Matrices -- Discrete Geometry on Red and Blue Points in the PlaneยจC A Survey ยจC -- Configurations with Rational Angles and Trigonometric DiophantineEquations -- Reconstructing Sets From Interpoint Distances -- Dense Packings of Congruent Circles in Rectangles with a Variable Aspect Ratio -- Colorings and Homomorphisms of Minor Closed Classes -- Conflict-free Colorings -- New Complexity Bounds for Cylindrical Decompositions of Sub-Pfaffian Sets -- Note on the Chromatic Number of the Space -- Expansive Motions and the Polytope of Pointed Pseudo-Triangulations -- Some Recent Quantitative and Algorithmic Results in Real Algebraic Geometry -- A Discrete Isoperimetric Inequality and Its Application to Sphere Packings -- On the Number of Maximal Regular Simplices Determined by n Points in Rd -- Balanced Lines, Halving Triangles, and the Generalized Lower Bound Theorem -- Quantizing Using Lattice Intersections -- Note on a Generalization of Rothโ{128}{153}s Theorem -- Arrangements, Equivariant Maps and Partitions of Measures by k-Fans -- Qualitative Infinite Version of Erd?sโ{128}{153} Problem About Empty Polygons

Mathematics
Computer science -- Mathematics
Geometry
Convex geometry
Discrete geometry
Probabilities
Combinatorics
Mathematics
Geometry
Convex and Discrete Geometry
Combinatorics
Discrete Mathematics in Computer Science
Probability Theory and Stochastic Processes