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.
With contributions by numerous expertsOn 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 ElimilC¨