Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash 86 tok/s
Gemini 2.5 Pro 51 tok/s Pro
GPT-5 Medium 43 tok/s
GPT-5 High 37 tok/s Pro
GPT-4o 98 tok/s
GPT OSS 120B 466 tok/s Pro
Kimi K2 225 tok/s Pro
2000 character limit reached

Pixelations of planar semialgebraic sets and shape recognition (1109.2573v3)

Published 12 Sep 2011 in math.DG, cs.CG, and math.GT

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.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

We haven't generated follow-up questions for this paper yet.