caa a22 4500 469075376 CHVBK 20180323132933.0 cr unu---uuuuu 170328e19920201xx s 000 0 eng 10.1007/BF02187834 doi (NATIONALLICENCE)springer-10.1007/BF02187834 Tiling polygons with parallelograms [Elektronische Daten] [Sampath Kannan, Danny Soroker] 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. Springer-Verlag New York Inc., 1992 Kannan Sampath University of Arizona, 85721, Tucson, AZ, USA aut Soroker Danny Shell Development Company, P.O. Box 481, 77001-0481, Houston, TX, USA aut Discrete & Computational Geometry Springer New York 7/2(1992-02-01), 175-188 0179-5376 7:2<175 1992 7 454 https://doi.org/10.1007/BF02187834 text/html Onlinezugriff via DOI 1 research-article jats NATIONALLICENCE 856 40 https://doi.org/10.1007/BF02187834 text/html Onlinezugriff via DOI NATIONALLICENCE 700 1- Kannan Sampath University of Arizona, 85721, Tucson, AZ, USA aut NATIONALLICENCE 700 1- Soroker Danny Shell Development Company, P.O. Box 481, 77001-0481, Houston, TX, USA aut NATIONALLICENCE 773 0- Discrete & Computational Geometry Springer New York 7/2(1992-02-01), 175-188 0179-5376 7:2<175 1992 7 454 Metadata rights reserved Springer special CC-BY-NC licence nationallicence BK010053 XK010053 XK010000 NATIONALLICENCE NATIONALLICENCE NL-springer