• Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Courses in Discrete and Computational Geometry

Courses in Discrete and Computational Geometry

Hardcover

Series: Bolyai Society Mathematical Studies, Book 31

General Mathematics

Currently unavailable to order

ISBN10: 3032105021
ISBN13: 9783032105028
Publisher: Springer
Published: May 12 2026
Pages: 321
Weight: 1.43
Height: 0.95 Width: 6.46 Depth: 9.33
Language: English

In the Fall of 2023, the Erdős Center (Budapest) hosted a special semester on Discrete Geometry and Convexity, which brought together some of the strongest experts in the field and many outstanding young researchers. The program featured intensive one-week mini-courses during a summer school, followed by conferences and workshops presenting cutting-edge research. Part I of the present volume includes the notes of three lecture series on: (1) approximation in discrete geometry, (2) on random polytopes, and (3) on a structure theory for graphs embedded in the plane. Part II starts with a classic: Matousek's until now unpublished elegant lecture notes concerning the algorithmic complexity of recognizing intersection graphs of segments and some other geometric objects. It is complemented by the first systematic and comprehensive survey of the corresponding complexity class: the existential theory of reals. This volume will be a valuable resource for graduate students, young researchers, and experts in related fields interested in discrete and computational geometry.

Also from

Pach, János

Also in

General Mathematics