Pixelations of planar semialgebraic sets and shape recognition
Differential Geometry
2015-05-27 v3 Computational Geometry
Geometric Topology
Abstract
We describe an algorithm that associates to each positive real number and each finite collection of planar pixels of size a planar piecewise linear set with the following additional property: if is the collection of pixels of size that touch a given compact semialgebraic set , then the normal cycle of converges to the normal cycle of in the sense of currents. In particular, in the limit we can recover the homotopy type of and its geometric invariants such as area, perimeter and curvature measures. At its core, this algorithm is a discretization of stratified Morse theory.
Cite
@article{arxiv.1109.2573,
title = {Pixelations of planar semialgebraic sets and shape recognition},
author = {Liviu I. Nicolaescu and Brandon Rowekamp},
journal= {arXiv preprint arXiv:1109.2573},
year = {2015}
}
Comments
36 pages, 13 figures, to appear in Algebraic & Geometric Topology