Seminar series
Date
Fri, 23 Oct 2020
Time
15:00 -
16:00
Location
Virtual
Speaker
Oliver Gäfvert
Organisation
KTH Stockholm
In this talk I will present an efficient algorithm to produce a provably dense sample of a smooth compact algebraic variety. The procedure is partly based on computing bottlenecks of the variety. Using geometric information such as the bottlenecks and the local reach we also provide bounds on the density of the sample needed in order to guarantee that the homology of the variety can be recovered from the sample.