English

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 rr and each finite collection CrC_r of planar pixels of size rr a planar piecewise linear set SrS_r with the following additional property: if CrC_r is the collection of pixels of size rr that touch a given compact semialgebraic set SS, then the normal cycle of SrS_r converges to the normal cycle of SS in the sense of currents. In particular, in the limit we can recover the homotopy type of SS and its geometric invariants such as area, perimeter and curvature measures. At its core, this algorithm is a discretization of stratified Morse theory.

Keywords

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

R2 v1 2026-06-21T19:03:40.075Z