1044 - Tiling the Plane

最新推荐文章于 2021-02-01 13:12:27 发布

不仅仅是寻找

最新推荐文章于 2021-02-01 13:12:27 发布

阅读量694

点赞数

分类专栏： uva

本文链接：https://blog.csdn.net/bigdata_lijun/article/details/11024711

版权

该程序旨在确定一个给定的直角多边形是否能够无间隙、无重叠地填充整个平面。已知只有两种基本的平面铺砌方式：正方形和六边形。输入包含多个多边形的描述，每个描述包括边的数量和方向及长度。输出对应每个多边形是否可能用于平面铺砌。

摘要由CSDN通过智能技术生成

A polygon is said to ``tile the plane" if a collection of identical copies of the polygon can be assembled to fill an unbounded two-dimensional plane without any gaps or overlap. For example, Figure 1 shows an L-shaped polygon, and Figure 2 shows how a portion of the plane can be tiled with copies of the polygon. You must write a program to determine whether a given polygon can tile the plane.

$\epsfbox{p3275.eps}$

Each test case consists of a closed polygon in which every vertex is at a right angle and the length of every side is an integer multiple of a unit length. You may make as many copies of the polygon as you like, and you may move them over the plane, but you may not rotate or reflect any polygon.

You might find the following information useful: It is known that there are only two fundamentally different tilings of the plane, the regular tiling by squares (chessboard tiling) and the tiling by regular hexagons (honeycomb tiling). A polygon can therefore tile the plane if and only if it satisfies one of the following two conditions: