Efficiently Testing Digital Convexity and Recognizing Digital Convex Polygons - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Journal of Mathematical Imaging and Vision Année : 2020

Efficiently Testing Digital Convexity and Recognizing Digital Convex Polygons

Résumé

A set S ⊂ Z 2 of integer points is digital convex if conv(S) ∩ Z 2 = S, where conv(S) denotes the convex hull of S. In this paper, we consider the following two problems. The first one is to test whether a given set S of n lattice points is digital convex. If the answer to the first problem is positive, then the second problem is to find a polygon P ⊂ Z 2 with minimum number of edges and whose intersection with the lattice P ∩Z 2 is exactly S. We provide linear-time algorithms for these two problems. The algorithm is based on the well-known quickhull algorithm. The time to solve both problems is O(n + h log r), where h = min(| conv(S)|, n 1/3) and r is the diameter of S.
Fichier principal
Vignette du fichier
digitalconvexityjournal.pdf (464.67 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03559062 , version 1 (05-02-2022)

Identifiants

Citer

Loïc Crombez, Guilherme D da Fonseca, Yan Gérard. Efficiently Testing Digital Convexity and Recognizing Digital Convex Polygons. Journal of Mathematical Imaging and Vision, 2020, ⟨10.1007/s10851-020-00957-6⟩. ⟨hal-03559062⟩
28 Consultations
94 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More