Enumeration of Vertices, Edges and Polygons in Tessellations of the Plane

نویسندگان

  • Marcelo Firer
  • Eduardo Brandani da Silva
چکیده

In this work, we consider the tessellations (or tilings) of Euclidean and hyperbolic planes using copies of a regular polygon. We introduce the concept of k-type of vertices and edges, which allow a thorough control of these elements when the tessellation increases, and we obtain an enumeration for the vertices, edges, and polygons at a given distance. Partially funded by a grant from Fapesp (2014/25463-6).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the behavior of growth of polygons in semi-regular hyperbolic tessellations

In this work we consider tessellations (or tilings) of the hyperbolic plane by copies of a semi-regular polygon with alternating angles and we study the behavior of the growth of the polygons, edges, and vertices when the distance increase from a fixed initial polygon. Subjects: Science; Mathematics & Statistics; Advanced Mathematics; Geometry

متن کامل

Wiener, Szeged and vertex PI indices of regular tessellations

A lot of research and various techniques have been devoted for finding the topological descriptor Wiener index, but most of them deal with only particular cases. There exist three regular plane tessellations, composed of the same kind of regular polygons namely triangular, square, and hexagonal. Using edge congestion-sum problem, we devise a method to compute the Wiener index and demonstrate th...

متن کامل

A Fast Algorithm for Covering Rectangular Orthogonal Polygons with a Minimum Number of r-Stars

Introduction This paper presents an algorithm for covering orthogonal polygons with minimal number of guards. This idea examines the minimum number of guards for orthogonal simple polygons (without holes) for all scenarios and can also find a rectangular area for each guards. We consider the problem of covering orthogonal polygons with a minimum number of r-stars. In each orthogonal polygon P,...

متن کامل

A Census of Vertices by Generations in Regular Tessellations of the Plane

We consider regular tessellations of the plane as infinite graphs in which q edges and q faces meet at each vertex, and in which p edges and p vertices surround each face. For 1/p + 1/q = 1/2, these are tilings of the Euclidean plane; for 1/p + 1/q < 1/2, they are tilings of the hyperbolic plane. We choose a vertex as the origin, and classify vertices into generations according to their distanc...

متن کامل

On the Moduli Space of Polygons in the Euclidean Plane

We study the topology of moduli spaces of polygons with xed side lengths in the Euclidean plane. We establish a duality between the spaces of marked Euclidean polygons with xed side lengths and marked convex Euclidean polygons with prescribed angles. 1. We consider the space P n of all polygons with n distinguished vertices in the Euclidean plane E 2 whose sides have nonnegative length allowing...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017