Algorithms for pixelwise shape deformations preserving digital convexity
From MaRDI portal
Publication:6160791
DOI10.1007/978-3-031-19897-7_8zbMATH Open1522.68679MaRDI QIDQ6160791FDOQ6160791
Authors: Lama Tarsissi, Yukiko Kenmochi, Hadjer Djerroumi, David Coeurjolly, Pascal Romon, Jean-Pierre Borel 
Publication date: 2 June 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Recommendations
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computing methodologies for image processing (68U10) Combinatorics on words (68R15)
Cites Work
- Introduction to algorithms
- Title not available (Why is that?)
- Certain words on the real projective line
- Factorizing words over an ordered alphabet
- Lyndon + Christoffel = digitally convex
- On Burnside's Problem
- A Lower Bound for the Volume of Strictly Convex Bodies with many Boundary Lattice Points
- Free differential calculus. IV: The quotient groups of the lower central series
- Title not available (Why is that?)
- On the maximal number of edges of convex digital polygons included into an \(m \times m\)-grid
- Further steps on the reconstruction of convex polyominoes from orthogonal projections
- The Boundary Count of Digital Pictures
- Title not available (Why is that?)
- Digital convex + unimodular mapping = 8-connected (all points but one 4-connected)
- An Arithmetical Characterization of the Convex Hull of Digital Straight Segments
Cited In (2)
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)
