Tiling polygons with parallelograms

DOI10.1007/BF02187834zbMath0747.52011MaRDI QIDQ1184161

Danny Soroker, Sampath Kannan

Publication date: 28 June 1992

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/131189

zbMATH Keywords

tilingssimple polygonscomputational geometry

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Tilings in (2) dimensions (aspects of discrete geometry) (52C20)

Related Items

Tiling a polygon with parallelograms, Sub Rosa, a system of quasiperiodic rhombic substitution tilings with \(n\)-fold rotational symmetry, Tiling pictures of the plane with dominoes, Self-affine convex polygons, Parallelogram tilings, worms, and finite orientations, Cyclotomic aperiodic substitution tilings, Polygon Area Decomposition for Multiple-Robot Workspace Division

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Decomposition and intersection of simple splinegons
• Properties of matroids characterizable in terms of excluded matroids
• Tiling a polygon with parallelograms
• Conway's Tiling Groups
• Triangulation and shape-complexity
• Triangulating Simple Polygons and Equivalent Problems
• An $O(n\log \log n)$-Time Algorithm for Triangulating a Simple Polygon