Advances in Discrete and Computational Geometry.

Intro -- Contents -- Preface -- Geometric range searching and its relatives -- Deformed products and maximal shadows of polytopes -- Flag complexes, labelled rooted trees, and star shellings -- Discrepancy bounds for geometric set systems with square incidence matrices -- Computational topology -- Recent progress on packing and covering -- Acoptic polyhedra -- A proof of the strict monotone 4-step conjecture -- Interactions between real algebraic geometry and discrete and computational geometry -- Open problems in the combinatorics of visibility and illumination -- Halving lines and perfect cross-matchings -- Three-dimensional grid drawings of graphs -- On polygonal covers -- The universality theorems for oriented matroids and polytopes -- Periodic and aperiodic tilings of En -- The early years of computational geometry-a personal memoir -- Arrangements of surfaces in higher dimensions -- Geometric discrepancy theory -- Proof of Reay's conjecture on certain positive-dimensional intersections -- Progress in geometric transversal theory -- Recent progress on polytopes -- Appendix: Application challenges to computational geometry.

Description based on publisher supplied metadata and other sources.

Electronic reproduction. Ann Arbor, Michigan : ProQuest Ebook Central, 2024. Available via World Wide Web. Access may be limited to ProQuest Ebook Central affiliated libraries.