Discrete regular polygons for digital shape rigid motion via polygonization

Abstract : Recently, a sufficient condition, namely quasi-regularity, has been proposed for preserving the connectivity during the process of digitization of a continuous object whose boundary is not necessarily differentiable. Under this condition, a rigid motion scheme for digital objects of $\mathbb Z^2$ is proposed to guarantee that a well-composed object will remain well-composed, and its global geometry will be approximately preserved. In this paper, we are interested in polygons generated from digital objects and their rigid motions in $\mathbb Z^2$. For this, we introduce a notion of discrete regularity which is a restriction of quasi-regularity for polygons. This notion provides a simple geometric verification, based on the measure of lengths and angles, of quasi-regularity which is originally defined with morphological operators. Furthermore, we present a method for geometry-preserving rigid motions based on convex decomposition of polygons. This paper focuses on the implementation and on the reproduction of the method linking to an online demonstration. The way of using the C++ code source in other contexts is shown as well.
Complete list of metadatas

Cited literature [24 references]  Display  Hide  Download

Contributor : Nicolas Passat <>
Submitted on : Saturday, February 2, 2019 - 11:56:53 AM
Last modification on : Tuesday, July 2, 2019 - 5:46:34 PM
Long-term archiving on : Friday, May 3, 2019 - 4:43:42 PM


Ngo RRPR 2018.pdf
Files produced by the author(s)



Phuc Ngo, Yukiko Kenmochi, Nicolas Passat, Isabelle Debled-Rennesson. Discrete regular polygons for digital shape rigid motion via polygonization. International Workshop on Reproducible Research on Pattern Recognition (RRPR), 2018, Beijing, China. pp.55-70, ⟨10.1007/978-3-030-23987-9_4⟩. ⟨hal-01853795⟩



Record views


Files downloads