An Optimal Algorithm for Detecting Pseudo-squares

DOI10.1007/11907350_34zbMath1136.68555OpenAlexW1500269013MaRDI QIDQ5386040

Xavier Provençal, Srečko Brlek

Publication date: 17 April 2008

Published in: Discrete Geometry for Computer Imagery (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11907350_34

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Machine vision and scene understanding (68T45)

Related Items (7)

Lyndon + Christoffel = digitally convex ⋮ Two infinite families of polyominoes that tile the plane by translation in two distinct ways ⋮ Planar Configurations Induced by Exact Polyominoes ⋮ Combinatorial View of Digital Convexity ⋮ Christoffel and Fibonacci Tiles ⋮ On the Number of p4-Tilings by an n-Omino ⋮ Unnamed Item

This page was built for publication: An Optimal Algorithm for Detecting Pseudo-squares