default search action
Xavier Provençal
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
- [j12]Jacques-Olivier Lachaud, Xavier Provençal, Tristan Roussillon
:
Two Plane-Probing Algorithms for the Computation of the Normal Vector to a Digital Plane. J. Math. Imaging Vis. 59(1): 23-39 (2017) - 2016
- [j11]Jacques-Olivier Lachaud, Xavier Provençal
An output-sensitive algorithm to compute the normal vector of a digital plane. Theor. Comput. Sci. 624: 73-88 (2016) - [j10]Eric Domenjoud, Xavier Provençal, Laurent Vuillon:
Palindromic language of thin discrete planes. Theor. Comput. Sci. 624: 101-108 (2016) - [c11]Damien Jamet, Nadia Lafrenière
Generation of Digital Planes Using Generalized Continued-Fractions Algorithms. DGCI 2016: 45-56 - [c10]Jacques-Olivier Lachaud, Xavier Provençal, Tristan Roussillon:
Computation of the Normal Vector to a Digital Plane by Sampling Significant Points. DGCI 2016: 194-205 - 2015
- [j9]Xavier Provençal
Discrete segments of Z3 constructed by synchronization of words. Discret. Appl. Math. 183: 102-117 (2015) - [c9]Srecko Brlek, Nadia Lafrenière
Palindromic Complexity of Trees. DLT 2015: 155-166 - 2014
- [c8]Eric Domenjoud, Xavier Provençal, Laurent Vuillon:
Facet Connectedness of Discrete Hyperplanes with Zero Intercept: The General Case. DGCI 2014: 1-12 - 2013
- [j8]Valérie Berthé, Annie Lacasse, Geneviève Paquin, Xavier Provençal:
A study of Jacobi-Perron boundary words for the generation of discrete planes. Theor. Comput. Sci. 502: 118-142 (2013) - [c7]Valérie Berthé, Damien Jamet, Timo Jolivet, Xavier Provençal:
Critical Connectedness of Thin Arithmetical Discrete Planes. DGCI 2013: 107-118 - [i1]Valérie Berthé, Damien Jamet, Timo Jolivet, Xavier Provençal:
Critical connectedness of thin arithmetical discrete planes. CoRR abs/1312.7820 (2013) - 2011
- [j7]Jacques-Olivier Lachaud, Xavier Provençal:
Two linear-time algorithms for computing the minimum length polygon of a digital contour. Discret. Appl. Math. 159(18): 2229-2250 (2011) - [j6]Srecko Brlek, Xavier Provençal:
Discrete geometry for computer imagery. Pattern Recognit. Lett. 32(9): 1355 (2011) - [j5]Xavier Provençal:
Minimal non-convex words. Theor. Comput. Sci. 412(27): 3002-3009 (2011) - [j4]Srecko Brlek, Xavier Provençal:
Advances in discrete geometry. Theor. Comput. Sci. 412(36): 4755-4756 (2011) - [j3]Srecko Brlek, Michel Koskas, Xavier Provençal:
A linear time and space algorithm for detecting path intersection in Zd. Theor. Comput. Sci. 412(36): 4841-4850 (2011) - [c6]Jacques-Olivier Lachaud, Xavier Provençal:
Dynamic Minimum Length Polygon. IWCIA 2011: 208-221
2000 – 2009
- 2009
- [j2]Srecko Brlek, Xavier Provençal, Jean-Marc Fedou:
On the tiling by translation problem. Discret. Appl. Math. 157(3): 464-475 (2009) - [j1]Srecko Brlek, Jacques-Olivier Lachaud, Xavier Provençal, Christophe Reutenauer:
Lyndon + Christoffel = digitally convex. Pattern Recognit. 42(10): 2239-2246 (2009) - [c5]Xavier Provençal, Jacques-Olivier Lachaud:
Two Linear-Time Algorithms for Computing the Minimum Length Polygon of a Digital Contour. DGCI 2009: 104-117 - [c4]Srecko Brlek, Michel Koskas, Xavier Provençal:
A Linear Time and Space Algorithm for Detecting Path Intersection. DGCI 2009: 397-408 - [e1]Srecko Brlek, Christophe Reutenauer, Xavier Provençal:
Discrete Geometry for Computer Imagery, 15th IAPR International Conference, DGCI 2009, Montréal, Canada, September 30 - October 2, 2009. Proceedings. Lecture Notes in Computer Science 5810, Springer 2009, ISBN 978-3-642-04396-3 [contents] - 2008
- [c3]Srecko Brlek, Jacques-Olivier Lachaud, Xavier Provençal:
Combinatorial View of Digital Convexity. DGCI 2008: 57-68 - 2006
- [c2]Srecko Brlek, Xavier Provençal:
An Optimal Algorithm for Detecting Pseudo-squares. DGCI 2006: 403-412 - [c1]Srecko Brlek, Xavier Provençal:
On the problem of deciding if a polyomino tiles the plane by translation. Stringology 2006: 65-76
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:58 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: