Xavier Provençal

According to our database, Xavier Provençal authored at least 22 papers between 2006 and 2017.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2017

Two Plane-Probing Algorithms for the Computation of the Normal Vector to a Digital Plane.

Jacques-Olivier Lachaud, Xavier Provençal, Tristan Roussillon

J. Math. Imaging Vis., 2017

2016

An output-sensitive algorithm to compute the normal vector of a digital plane.

Jacques-Olivier Lachaud, Xavier Provençal, Tristan Roussillon

Theor. Comput. Sci., 2016

Palindromic language of thin discrete planes.

Eric Domenjoud, Xavier Provençal, Laurent Vuillon

Theor. Comput. Sci., 2016

Computation of the Normal Vector to a Digital Plane by Sampling Significant Points.

Jacques-Olivier Lachaud, Xavier Provençal, Tristan Roussillon

Proceedings of the Discrete Geometry for Computer Imagery, 2016

Generation of Digital Planes Using Generalized Continued-Fractions Algorithms.

Damien Jamet, Nadia Lafrenière, Xavier Provençal

Proceedings of the Discrete Geometry for Computer Imagery, 2016

2015

Discrete segments of Z³ constructed by synchronization of words.

Xavier Provençal, Laurent Vuillon

Discret. Appl. Math., 2015

Palindromic Complexity of Trees.

Srecko Brlek, Nadia Lafrenière, Xavier Provençal

Proceedings of the Developments in Language Theory - 19th International Conference, 2015

2014

Facet Connectedness of Discrete Hyperplanes with Zero Intercept: The General Case.

Eric Domenjoud, Xavier Provençal, Laurent Vuillon

Proceedings of the Discrete Geometry for Computer Imagery, 2014

2013

A study of Jacobi-Perron boundary words for the generation of discrete planes.

Valérie Berthé, Annie Lacasse, Geneviève Paquin, Xavier Provençal

Theor. Comput. Sci., 2013

Critical Connectedness of Thin Arithmetical Discrete Planes.

Valérie Berthé, Damien Jamet, Timo Jolivet, Xavier Provençal

Proceedings of the Discrete Geometry for Computer Imagery, 2013

2011

Minimal non-convex words.

Xavier Provençal

Theor. Comput. Sci., 2011

Advances in discrete geometry.

Srecko Brlek, Xavier Provençal

Theor. Comput. Sci., 2011

A linear time and space algorithm for detecting path intersection in Z^d.

Srecko Brlek, Michel Koskas, Xavier Provençal

Theor. Comput. Sci., 2011

Discrete geometry for computer imagery.

Srecko Brlek, Xavier Provençal

Pattern Recognit. Lett., 2011

Two linear-time algorithms for computing the minimum length polygon of a digital contour.

Jacques-Olivier Lachaud, Xavier Provençal

Discret. Appl. Math., 2011

Dynamic Minimum Length Polygon.

Jacques-Olivier Lachaud, Xavier Provençal

Proceedings of the Combinatorial Image Analysis - 14th International Workshop, 2011

2009

Lyndon + Christoffel = digitally convex.

Srecko Brlek, Jacques-Olivier Lachaud, Xavier Provençal, Christophe Reutenauer

Pattern Recognit., 2009

On the tiling by translation problem.

Srecko Brlek, Xavier Provençal, Jean-Marc Fedou

Discret. Appl. Math., 2009

A Linear Time and Space Algorithm for Detecting Path Intersection.

Srecko Brlek, Michel Koskas, Xavier Provençal

Proceedings of the Discrete Geometry for Computer Imagery, 2009

2008

Combinatorial View of Digital Convexity.

Srecko Brlek, Jacques-Olivier Lachaud, Xavier Provençal

Proceedings of the Discrete Geometry for Computer Imagery, 2008

2006

On the problem of deciding if a polyomino tiles the plane by translation.

Srecko Brlek, Xavier Provençal

Proceedings of the Prague Stringology Conference, 2006

An Optimal Algorithm for Detecting Pseudo-squares.

Srecko Brlek, Xavier Provençal

Proceedings of the Discrete Geometry for Computer Imagery, 13th International Conference, 2006