Estimating perimeter using graph cuts

Nicolás García Trillos, Dejan Slepčev, James von Brecht

We investigate the estimation of the perimeter of a set by a graph cut of a random geometric graph. For $\Omega \subset D=(0,1{)}^d$, with $d\ge 2$, we are given $n$ random i.i.d. poin…