We investigate the estimation of the perimeter of a set by a graph cut of a random geometric graph. For Ω ⊆ D = (0, 1)d with d ≥ 2, we are given n random independent and identically distributed points ...

This lecture course is devoted to the study of random geometrical objects and structures. Among the most prominent models are random polytopes, random tessellations, particle processes and random ...