Algorithms for pixelwise shape deformations preserving digital convexity
From MaRDI portal
Publication:6160791
Recommendations
Cites work
- scientific article; zbMATH DE number 25391 (Why is no real title available?)
- scientific article; zbMATH DE number 2084493 (Why is no real title available?)
- scientific article; zbMATH DE number 1737190 (Why is no real title available?)
- A Lower Bound for the Volume of Strictly Convex Bodies with many Boundary Lattice Points
- An arithmetical characterization of the convex hull of digital straight segments
- Certain words on the real projective line
- Digital convex + unimodular mapping = 8-connected (all points but one 4-connected)
- Factorizing words over an ordered alphabet
- Free differential calculus. IV: The quotient groups of the lower central series
- Further steps on the reconstruction of convex polyominoes from orthogonal projections
- Introduction to algorithms
- Lyndon + Christoffel = digitally convex
- On Burnside's Problem
- On the maximal number of edges of convex digital polygons included into an \(m \times m\)-grid
- The Boundary Count of Digital Pictures
Cited in
(5)- Convexity preserving deformations of digital sets: characterization of removable and insertable pixels
- First steps in the algorithmic reconstruction of digital convex sets
- scientific article; zbMATH DE number 3956457 (Why is no real title available?)
- Pixelations of planar semialgebraic sets and shape recognition
- A shape-preserving variant of Lane-Riesenfeld algorithm
This page was built for publication: Algorithms for pixelwise shape deformations preserving digital convexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6160791)