Xavier Provençal

25 papers C 2Misc 1Journal 13Unranked 8
YearRankTypeTitle / Venue / Authors
2017 J jnl
Two Plane-Probing Algorithms for the Computation of the Normal Vector to a Digital Plane.
J. Math. Imaging Vis.
Jacques-Olivier Lachaud, Xavier Provençal, Tristan Roussillon
2016 J jnl
An output-sensitive algorithm to compute the normal vector of a digital plane.
Theor. Comput. Sci.
Jacques-Olivier Lachaud, Xavier Provençal, Tristan Roussillon
2016 — conf
Computation of the Normal Vector to a Digital Plane by Sampling Significant Points.
DGCI
Jacques-Olivier Lachaud, Xavier Provençal, Tristan Roussillon
2016 — conf
Generation of Digital Planes Using Generalized Continued-Fractions Algorithms.
DGCI
Damien Jamet, Nadia Lafrenière, Xavier Provençal
2016 J jnl
Palindromic language of thin discrete planes.
Theor. Comput. Sci.
Eric Domenjoud, Xavier Provençal, Laurent Vuillon
2015 J jnl
Discrete segments of Z
Discret. Appl. Math.
Xavier Provençal, Laurent Vuillon
2015 C conf
Palindromic Complexity of Trees.
DLT
Srecko Brlek, Nadia Lafrenière, Xavier Provençal
2014 — conf
Facet Connectedness of Discrete Hyperplanes with Zero Intercept: The General Case.
DGCI
Eric Domenjoud, Xavier Provençal, Laurent Vuillon
2013 J jnl
A study of Jacobi-Perron boundary words for the generation of discrete planes.
Theor. Comput. Sci.
Valérie Berthé, Annie Lacasse, Geneviève Paquin, Xavier Provençal
2013 — conf
Critical Connectedness of Thin Arithmetical Discrete Planes.
DGCI
Valérie Berthé, Damien Jamet, Timo Jolivet, Xavier Provençal
2013 J jnl
Critical connectedness of thin arithmetical discrete planes.
CoRR
Valérie Berthé, Damien Jamet, Timo Jolivet, Xavier Provençal
2011 J jnl
A linear time and space algorithm for detecting path intersection in Z
Theor. Comput. Sci.
Srecko Brlek, Michel Koskas, Xavier Provençal
2011 J jnl
Advances in discrete geometry.
Theor. Comput. Sci.
Srecko Brlek, Xavier Provençal
2011 J jnl
Discrete geometry for computer imagery.
Pattern Recognit. Lett.
Srecko Brlek, Xavier Provençal
2011 C conf
Dynamic Minimum Length Polygon.
IWCIA
Jacques-Olivier Lachaud, Xavier Provençal
2011 J jnl
Minimal non-convex words.
Theor. Comput. Sci.
Xavier Provençal
2011 J jnl
Two linear-time algorithms for computing the minimum length polygon of a digital contour.
Discret. Appl. Math.
Jacques-Olivier Lachaud, Xavier Provençal
2009 — conf
A Linear Time and Space Algorithm for Detecting Path Intersection.
DGCI
Srecko Brlek, Michel Koskas, Xavier Provençal
2009 — ed.
Discrete Geometry for Computer Imagery, 15th IAPR International Conference, DGCI 2009, Montréal, Canada, September 30 - October 2, 2009. Proceedings
DGCI
Srecko Brlek, Christophe Reutenauer, Xavier Provençal
2009 J jnl
Lyndon + Christoffel = digitally convex.
Pattern Recognit.
Srecko Brlek, Jacques-Olivier Lachaud, Xavier Provençal, Christophe Reutenauer
2009 J jnl
On the tiling by translation problem.
Discret. Appl. Math.
Srecko Brlek, Xavier Provençal, Jean-Marc Fedou
2009 — conf
Two Linear-Time Algorithms for Computing the Minimum Length Polygon of a Digital Contour.
DGCI
Xavier Provençal, Jacques-Olivier Lachaud
2008 — conf
Combinatorial View of Digital Convexity.
DGCI
Srecko Brlek, Jacques-Olivier Lachaud, Xavier Provençal
2006 — conf
An Optimal Algorithm for Detecting Pseudo-squares.
DGCI
Srecko Brlek, Xavier Provençal
2006 Misc conf
On the problem of deciding if a polyomino tiles the plane by translation.
PSC
Srecko Brlek, Xavier Provençal