The following pages link to Xavier Provençal (Q265046):
Displayed 24 items.
- An output-sensitive algorithm to compute the normal vector of a digital plane (Q265048) (← links)
- Palindromic language of thin discrete planes (Q265052) (← links)
- A study of Jacobi-Perron boundary words for the generation of discrete planes (Q391409) (← links)
- Minimal non-convex words (Q544886) (← links)
- A linear time and space algorithm for detecting path intersection in \(\mathbb Z^d\) (Q638566) (← links)
- (Q765321) (redirect page) (← links)
- Two linear-time algorithms for computing the minimum length polygon of a digital contour (Q765322) (← links)
- Lyndon + Christoffel = digitally convex (Q834259) (← links)
- On the tiling by translation problem (Q1003706) (← links)
- Discrete segments of \(\mathbb{Z}^3\) constructed by synchronization of words (Q2255823) (← links)
- Two plane-probing algorithms for the computation of the normal vector to a digital plane (Q2403741) (← links)
- Dynamic Minimum Length Polygon (Q3003536) (← links)
- Facet Connectedness of Discrete Hyperplanes with Zero Intercept: The General Case (Q3190060) (← links)
- Palindromic Complexity of Trees (Q3451098) (← links)
- (Q3575005) (← links)
- Two Linear-Time Algorithms for Computing the Minimum Length Polygon of a Digital Contour (Q3648777) (← links)
- A Linear Time and Space Algorithm for Detecting Path Intersection (Q3648803) (← links)
- (Q4453472) (← links)
- Critical Connectedness of Thin Arithmetical Discrete Planes (Q4924464) (← links)
- (Q5178685) (← links)
- An Optimal Algorithm for Detecting Pseudo-squares (Q5386040) (← links)
- Combinatorial View of Digital Convexity (Q5458874) (← links)
- Generation of Digital Planes Using Generalized Continued-Fractions Algorithms (Q5739384) (← links)
- Computation of the Normal Vector to a Digital Plane by Sampling Significant Points (Q5739396) (← links)