Pixelations of planar semialgebraic sets and shape recognition
Abstract
We describe an algorithm that associates to each positive real number r and each finite collection Cr of planar pixels of size r a planar piecewise linear set Sr with the following additional property: if Cr is the collection of pixels of size r that touch a given compact semialgebraic set S, then the normal cycle of Sr converges to the normal cycle of S in the sense of currents. In particular, in the limit we can recover the homotopy type of S and its geometric invariants such as area, perimeter and curvature measures. At its core, this algorithm is a discretization of stratified Morse theory.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.