Efficient Algorithms to Test Digital Convexity

Loïc Crombez, Guilherme D. da Fonseca, Yan Gérard

A set $S\subset {\mathbb{Z}}^d$ is digital convex if $conv(S)\cap {\mathbb{Z}}^d=S$, where $conv(S)$ denotes the convex hull of $S$. In this paper, we consider the algorithmic prob…