Pixelations of planar semialgebraic sets and shape recognition
classification
🧮 math.DG
cs.CGmath.GT
keywords
planaralgorithmcollectioncyclenormalpixelssemialgebraicsize
read the original abstract
We describe an algorithm that associates to each positive real number $r$ and each finite collection $C_r$ of planar pixels of size $r$ a planar piecewise linear set $S_r$ with the following additional property: if $C_r$ is the collection of pixels of size $r$ that touch a given compact semialgebraic set $S$, then the normal cycle of $S_r$ 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.