An Optimal Algorithm for Detecting Pseudo-squares

DOI10.1007/11907350_34MaRDI QIDQ5386040zbMATH OpenOpenAlexFDO

Authors Srečko Brlek, Xavier Provençal

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) Machine vision and scene understanding (68T45) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• On the tiling by translation problem
• An algorithm for deciding if a polyomino tiles the plane
• An optimal algorithm for tiling the plane with a translated polyomino
• Tilings by translation: enumeration by a rational language approach
• Isohedral polyomino tiling of the plane

Cited in

(12)

• On the tiling by translation problem
• Planar configurations induced by exact polyominoes
• Christoffel and Fibonacci tiles
• Detection of cisoids using least square error function
• scientific article; zbMATH DE number 7278010 (Why is no real title available?)
• On the number of p4-tilings by an n-omino
• An algorithm for deciding if a polyomino tiles the plane
• Combinatorial View of Digital Convexity
• Two infinite families of polyominoes that tile the plane by translation in two distinct ways
• Tilings by translation: enumeration by a rational language approach
• Lyndon + Christoffel = digitally convex
• Optimality of some algorithms to detect quasiperiodicities

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5386040)