Multiple fault diagnosis of down-hole conditions of sucker-rod pumping wells based on Freeman chain code and DCA

K Li, X Gao, W Yang, Y Dai, Z Tian - Petroleum Science, 2013 - Springer
It is important to achieve continuous, stable and efficient pumping well operation in actual
oilfield operation. Down-hole pumping well working conditions can be monitored in real-time …

Combinatorial properties of double square tiles

AB Massé, A Garon, S Labbé - Theoretical Computer Science, 2013 - Elsevier
We study the combinatorial properties and the problem of generating exhaustively double
square tiles, ie polyominoes yielding two distinct periodic tilings by translated copies such …

[HTML][HTML] A parallelogram tile fills the plane by translation in at most two distinct ways

AB Massé, S Brlek, S Labbé - Discrete Applied Mathematics, 2012 - Elsevier
We consider the tilings by translation of a single polyomino or tile on the square grid Z2. It is
well-known that there are two regular tilings of the plane, namely, parallelogram and …

A decomposition theorem for homogeneous sets with respect to diamond probes

D Battaglino, A Frosini, S Rinaldi - Computer Vision and Image …, 2013 - Elsevier
An unknown planar discrete set of points A can be inspected by means of a probe P of
generic shape that moves around it, and reveals, for each position, the number of its …

Efficient computation of the outer hull of a discrete path

S Brlek, H Tremblay, J Tremblay, R Weber - Discrete Geometry for …, 2014 - Springer
We present here a linear time and space algorithm for computing the outer hull of any
discrete path encoded by its Freeman chain code. The basic data structure uses an enriched …

[HTML][HTML] Efficient operations on discrete paths

AB Massé, S Brlek, H Tremblay - Theoretical Computer Science, 2016 - Elsevier
We present linear time and space operations on discrete paths. First, we compute the outer
hull of any discrete path. As a consequence, a linear time and space algorithm is obtained …

Interactions between digital geometry and combinatorics on words

S Brlek - arXiv preprint arXiv:1108.3615, 2011 - arxiv.org
We review some recent results in digital geometry obtained by using a combinatorics on
words approach to discrete geometry. Motivated on the one hand by the well-known theory …

An optimal algorithm to generate extendable self-avoiding walks in arbitrary dimension

P Préa, M Rouault, F Brucker - Electronic Notes in Discrete Mathematics, 2017 - Elsevier
A self-avoiding walk (SAW) is extendable [Grimmett, GR, AE Holroyd and Y. Peres,
Extendable Self-Avoiding Walks, Ann. Inst. Henri Poincaré Comb. Phys. Interact., 1 (2014) …

Parallelogram morphisms and circular codes

AB Massé, M Lapointe, H Tremblay - … , Czech Republic, March 14-18, 2016 …, 2016 - Springer
In 2014, it was conjectured that any polyomino can be factorized uniquely as a product of
prime polyominoes 7. In this paper, we present simple tools from words combinatorics and …

À l'intersection de la combinatoire des mots et de la géométrie discrète: palindromes, symétries et pavages

AB Massé - 2011 - theses.hal.science
Dans cette thèse, différents problèmes de la combinatoire des mots et de géométrie discrète
sont considérés. Nous étudions d'abord l'occurrence des palindromes dans les codages de …