(V. Berthé, A. Lacasse, G. Paquin, X. Provençal, A study of Jacobi-Perron boundary words for the generation of discrete planes, accepté novembre 2011.)
J.-O. Lachaud, X. Provençal, Two linear-time algorithms for computing the minimum length polygon of a digital contour, Discrete Applied Mathematics (DAM) 159, 2011, p.2229-2250.
(Accès via ScienceDirect.com)
S. Brlek, M. Koskas, X. Provençal, A linear time and space algorithm for detecting path intersection in image Zd, Theoretical Computer Science (TCS) 412, 2011, p. 4841-4850.
(preprint) --
(Accès via ScienceDirect.com)
S. Brlek, J.O. Lachaud, X. Provençal, C. Reutenauer, Lyndon + Christoffel = Digitally
Convex, Pattern Recognition (PR) 42, 2009, p. 2239-2246.
(preprint) --
(Accès via ScienceDirect.com)
S. Brlek, X. Provençal, J.M. Fédou, On the Tiling by Translation
Problem, Discrete Applied Mathematics (DAM) 157, 2009, p. 464-475.
(preprint) --
(Accès via ScienceDirect.com)
Conférences
J.-O. Lachaud, X. Provençal, Dynamic Minimum Length Polygon,
Proc. 14-th International Workshop on Combinatorial Image Analysis (IWCIA
2011), Madrid (Espagne), May 2011, p. 208-221.
(Accès via springerlink.com)
S. Brlek, M. Koskas, X. Provençal, A Linear Time and Space Algorithm for
Detecting Path Intersection, Proc. 15-th International Conference
Discrete Geometry for Computer Imagery (DGCI 2009), Montréal (Canada),
septembre 2009, p. 297-408.
(Accès via springerlink.com)
X. Provençal, J.-O. Lachaud, Two Linear-Time Algorithms
for Computing the Minimum Length Polygon of a Digital Contour, Proc.
15-th International Conference Discrete Geometry for Computer Imagery (DGCI
2009), Montréal (Canada), septembre 2009, p. 102-117.
(preprint) --
(Accès via springerlink.com)
X. Provençal, Non-Convex Words, Proc. 7-th
International Conference on Words (Words 2009), Salerno (Italie), septembre
2009, 11 pages.
S. Brlek, J.-O. Lachaud, X. Provençal, Combinatorial View of Convexity,
Proc. 14-th International Conference Discrete Geometry for Computer Imagery
(DGCI 2008), Lyon (France), avril 2008, p. 57-68.
(Accès via springerlink.com)
S. Brlek, X. Provençal, An Optimal Algorithm for Detecting
Pseudo-Squares, Proc. 13-th International Conference Discrete Geometry
for Computer Imagery (DGCI 2006), Szeged (Hongrie), octobre 2006, p. 403-412.
(Accès via springerlink.com)
G. Labelle, L. Laforest, X. Provençal, Around the Root of Random
Multidimensional Quadtrees, Proc. 4-th Colloquium of Mathematics and
Computer Science Algorithms, Trees, Combinatorics and Probabilities (MathInfo
2006), Nancy (France), septembre 2006, p. 335-344.
(Accès via DMTCS.com)
S. Brlek, X. Provençal, On Problem of Deciding If a Polyomino Tiles the
Plane by Translation, Proc. of the Prague Stringology Conference 2006
(PSC 2006), Prague (République Tchèque), août 2006, p. 65-76.
(Accès via stringology.org)
S. Brlek, X. Provençal, A fast algorithm for detecting pseudo-hexagons,
Proc. International School and Conference on Combinatorics, Automata and Number
Theory (CANT 2006), Liège (Belgique), mai 2006.
S. Brlek, A. Bergeron-Brlek, A. Lacassse, X. Provençal, Patterns in smooth
tilings, Proc. 4-th International Conference on Words (Words 2003),
Turku (Finlande), septembre 2003, p. 370-381.
(preprint)
Éditions d'ouvrages scientifiques
Pattern Recognition Letters, Volume 32, Issue 9. Special Issue on
Discrete Geometry for Computer Imagery, 15-th IAPR Conf. S. Brlek, X.
Provençal, (DGCI 2009), Elsevier. Paru le 1er juillet 2011.
(Accès via ScienceDirect.com)
Theoretical Computer Science, Volume 412, Issue 36. Special Issue on Discrete
Geometry for Computer Imagery, 15-th IAPR Conf. S. Brlek, X. Provençal,
(DGCI 2009), Elsevier. Paru le 19 août 2011.
(Accès via ScienceDirect.com)
Discrete Geometry for Computer Imagery, 15-th IAPR Conf. S.
Brlek, C. Reutenauer, X. Provençal, (DGCI 2009), Montréal (Canada). 540p. LNCS
5810. Springer Verlag. 2009.
(Accès via springerlink.com)
