Xavier Provençal

Liste de publications

Journaux

  • J.-O. Lachaud, X. Provençal, T Roussillon, Two plane-probing algorithms for the computation of the normal vector to a digital plane, Journal of Mathematical Imaging and Vision, 2017, p. 1-17. (preprint) -- (Accès via Springer.com)

  • J.-O. Lachaud, X. Provençal, T Roussillon, An output-sensitive algorithm to compute the normal vector of a digital plane, Theoretical Computer Science (TCS), 624, 2016, p. 73-88.
    (preprint) -- (Accès via ScienceDirect.com)

  • É. Domenjoud, X. Provençal, L. Vuillon, Palindromic language of thin discrete planes, Theoretical Computer Science (TCS), 624, 2016, p. 101-108.
    (preprint) -- (Accès via ScienceDirect.com)

  • X. Provençal, L. Vuillon, Discrete segments of Z3 constructed by synchronization of words, Discrete Applied Mathematics (DAM), 183, 2015, p. 102-117.
    (preprint) -- (Accès via ScienceDirect.com)

  • V. Berthé, É. Domenjoud, D. Jamet, X. Provençal, Fully subtractive algorithm, tribonacci numeration and connectedness of discrete planes, Research Institute for Mathematical Sciences (RIMS), Lecture note Kokyuroku Bessatu B46, 2014, p. 159-174.
    (preprint)

  • V. Berthé, A. Lacasse, G. Paquin, X. Provençal, A study of Jacobi-Perron boundary words for the generation of discrete planes, Theoretical Computer Science (TCS), 502, 2013, p. 118-142.
    (preprint) - - (Accès via ScienceDirect.com)

  • 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.
    (preprint) - - (Accès via ScienceDirect.com)

  • S. Brlek, M. Koskas, X. Provençal, A linear time and space algorithm for detecting path intersection in Zd, Theoretical Computer Science (TCS) 412, 2011, p. 4841-4850.
    (preprint) - - (Accès via ScienceDirect.com)

  • X. Provençal, Minimal Non-Convex Words, Theoretical Computer Sciences (TCS) 412, 2011, p. 3002-3009.
    (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)

ArXiv

  • V. Berthé, D. Jamet, T. Jolivet, X. Provençal, Critical Connectedness of Thin Arithmetical Discrete Planes, The Computing Research Repository (CoRR), 2013, 18 pages.
    (Accès via arXiv.org)

Actes de conférences

  • D. Jamet, N. Lafrenière, X. Provençal, Generation of Digital Planes Using Generalized Continued-Fractions Algorithms, (DGCI 2016), LNCS 9647, Nantes (France), avril 2016, p. 45-56.
    (preprint) - - (Accès via SpringerLink)

  • J.-O. Lachaud, X. Provençal, T. Roussillon, Computation of the normal vector to a digital plane by sampling significant points, (DGCI 2016), LNCS 9647, Nantes (France), avril 2016, p. 194-205.
    (preprint) - - (Accès via SpringerLink)

  • S. Brlek, N. Lafrenière, X. Provençal, Palindromic Complexity of Trees. Proc. 19-th International Conference on Developments in Language Theory (DLT 2015), LNCS 9168, Liverpool (Angleterre), juillet 2015, p. 155-166.
    (preprint) - - (Accès via SpringerLink)

  • E. Domenjoud, X. Provençal, L. Vuillon, Facet Connectedness of Discrete Hyperplanes with Zero Intercept: The General Case, Proc. 17-th International Conference Discrete Geometry for Computer Imagery (DGCI 2014), LNCS 8668, Sienne (Italie), septembre 2014, p. 1-12.
    (preprint) - - (Accès via SpringerLink)

  • V. Berthé, D. Jamet, T. Jolivet, X. Provençal, Critical Connectedness of Thin Arithmetical Discrete Planes, Proc. 17-th International Conference Discrete Geometry for Computer Imagery (DGCI 2013), LNCS 7749, Séville (Espagne), mars 2013, p. 107-118.
    (preprint) - - (Accès via SpringerLink)

  • J.-O. Lachaud, X. Provençal, Dynamic Minimum Length Polygon, Proc. 14-th International Workshop on Combinatorial Image Analysis (IWCIA 2011), LNCS 6636, Madrid (Espagne), May 2011, p. 208-221.
    (preprint) - - (Accès via SpringerLink)

  • 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)

  • 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), LNCS 5810, Montréal (Canada), septembre 2009, p. 102-117.
    (preprint) - - (Accès via SpringerLink)

  • 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)

  • 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)

  • 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), LNCS 4245, Nancy (France), septembre 2006, p. 335-344.
    (Accès via DMTCS.com)

  • S. Brlek, X. Provençal, On the 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)