Algorithms for Pixelwise Shape Deformations Preserving Digital Convexity
In this article, we propose algorithms for pixelwise deformations of digital convex sets preserving their convexity using the combinatorics on words to identify digital convex sets via their boundary words, namely Lyndon and Christoffel words. The notion of removable and insertable points are used w...
Saved in:
| Main Author: | Tarsissi, Lama (author) |
|---|---|
| Other Authors: | Kenmochi, Y (author), Djerroumi, H (author), Coeurjolly, D. (author), Romon, P. (author), Borel, JP (author) |
| Published: |
2022
|
| Online Access: | https://depot.sorbonne.ae/handle/20.500.12458/1350 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Further steps on the reconstruction of convex polyominoes from orthogonal projections
by: Tarsissi, Lama
Published: (2021) -
Local convexity preserving rational cubic spline curves
by: Sarfraz, M.
Published: (1997) -
SINE-HYPERBOLIC CONVEX VARIABLE STEP-SIZE ALGORITHM
by: unknown
Published: (2020) -
A New Penalty Function Algorithm For Convex Quadratic Programming
by: Bendaya, M.
Published: (2020) -
Efficient convex-elastic net algorithm to solve the Euclideantraveling salesman problem
by: Al-Mulhem, M.
Published: (1998)