Discrete Regular Polygons for Digital Shape Rigid Motion via Polygonization

0Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.

This article is free to access.

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 Z2 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 Z2. 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++ source code in other contexts is shown as well.

Cite

CITATION STYLE

APA

Ngo, P., Kenmochi, Y., Passat, N., & Debled-Rennesson, I. (2019). Discrete Regular Polygons for Digital Shape Rigid Motion via Polygonization. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11455 LNCS, pp. 55–70). Springer Verlag. https://doi.org/10.1007/978-3-030-23987-9_4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free