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: | |
|---|---|
| Other Authors: | , , , , |
| 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!
|
| Summary: | 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 with a geometric strategy for choosing one of those pixels for each deformation step. The worst-case time complexity of each deflation and inflation step, which is the atomic deformation, is also analysed. |
|---|