During the past few decades, the gradual merger of Discrete Geometry and the newer discipline of Computational Geometry has provided enormous impetus to mathematicians and computer scientists interested in geometric problems. This volume, which contains 32 papers on a broad range of topics of current interest in the field, is an outgrowth of that synergism. It includes surveys and research articles exploring geometric arrangements, polytopes, packing, covering, discrete convexity, geometric algorithms and their complexity, and the combinatorial complexity of geometric objects, particularly in low dimension. There are points of contact with many applied areas such as mathematical programming, visibility problems, kinetic data structures, and biochemistry, as well as with algebraic topology, geometric probability, real algebraic geometry, and combinatorics.
págs. 1-30
págs. 31-50
págs. 51-85
The Hadwiger Transversal Theorem for Pseudolines
Saugata Basu, Jacob E. Goodman, Andreas F. Holmsen, Richard Pollack
págs. 85-86
págs. 87-96
págs. 97-120
págs. 121-127
págs. 129-134
págs. 135-145
págs. 147-153
págs. 155-166
págs. 167-211
págs. 213-242
págs. 243-275
págs. 277-286
págs. 287-331
De Concini--Procesi Wonderful Arrangement Models: a Discrete Geometer's Point of View
págs. 333-360
págs. 361-376
págs. 377-397
págs. 399-407
págs. 409-431
págs. 433-437
págs. 439-458
págs. 459-478
págs. 479-494
págs. 495-500
págs. 501-516
págs. 517-528
págs. 529-556
The Erdo"s-Szekeres Theorem: upper Bounds and Related Results
págs. 557-568
págs. 569-575
págs. 577-616
© 2001-2024 Fundación Dialnet · Todos los derechos reservados