Abstract
Under what conditions can a simple polygon be tiled by parallelograms? In this paper we give matching necessary and sufficient conditions on the polygon to be tilable and characterize the set of possible tilings. We also provide an efficient algorithm for constructing a tiling. © 1992 Springer-Verlag New York Inc.
Cite
CITATION STYLE
APA
Kannan, S., & Soroker, D. (1992). Tiling polygons with parallelograms. Discrete & Computational Geometry, 7(1), 175–188. https://doi.org/10.1007/BF02187834
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free