[HTML][HTML] Efficient operations on discrete paths
AB Massé, S Brlek, H Tremblay - Theoretical Computer Science, 2016 - Elsevier
We present linear time and space operations on discrete paths. First, we compute the outer
hull of any discrete path. As a consequence, a linear time and space algorithm is obtained …
hull of any discrete path. As a consequence, a linear time and space algorithm is obtained …
A Measure of Q-convexity for Shape Analysis
P Balázs, S Brunetti - Journal of Mathematical Imaging and Vision, 2020 - Springer
In this paper, we study three basic novel measures of convexity for shape analysis. The
convexity considered here is the so-called Q-convexity, that is, convexity by quadrants. The …
convexity considered here is the so-called Q-convexity, that is, convexity by quadrants. The …
Linear time and space algorithms for discrete paths on the 1-uniform regular lattices of Z2
AB Massé, É Marcotte - Electronic Notes in Discrete Mathematics, 2017 - Elsevier
Abstract In 2009, Brlek, Koskas and Provençal proposed a data structure allowing self-
intersection detection of discrete paths in linear time and space in the worst case. However …
intersection detection of discrete paths in linear time and space in the worst case. However …
Un algorithme linéaire pour le calcul de l'enveloppe externe d'un chemin discret
RA Weber - 2015 - library-archives.canada.ca
Ce mémoire concerne le problème du calcul de l'enveloppe externe d'une figure et se situe
dans le domaine de la géométrie digitale, une branche importante de la géométrie discrète …
dans le domaine de la géométrie digitale, une branche importante de la géométrie discrète …