Probabilistic methods are ubiquitous in computer science and
computational geometry is no exception: from randomized algorithms,
averagecase complexity analysis of algorithms, to Erdós'
probabilistic lens in discrete geometry, probabilistic methods have
had a major impact on the field.
Most often, probabilistic methods are used in computational geometry by computational geometers themselves. There are, however, entire areas dedicated to the understanding of the properties of random geometric objects (stochastic geometry) or random generation mechanisms (analytic combinatorics). The proposed workshop aims at stimulating new interactions between these areas and the international community of discrete and computational geometers. OrganizersOlivier Devillers and Xavier Goaoc Tentative programThursday, June 25: 14:0015:35 and 16:0017:30
