Saturated fully leafed tree-like polyforms and polycubes
نویسندگان
چکیده
منابع مشابه
Fully leafed induced subtrees
Let G be a simple graph of n vertices. We consider the problem IS` of deciding whether there exists an induced subtree with exactly i ≤ n vertices and ` leaves inG. We also study the associated optimization problem, that consists in computing the maximal number of leaves, denoted by LG(i), realized by an induced subtree with i vertices, for 2 ≤ i ≤ n. We compute the values of the map LG for som...
متن کاملIsoperimetrically Optimal Polyforms
In the plane, the way to enclose the most area with a given perimeter and to use the shortest perimeter to enclose a given area, is always to use a circle. If we replace the plane by a regular tiling of it, and construct polyforms i.e. shapes as sets of tiles, things become more complicated. We need to redefine the area and perimeter measures, and study the consequences carefully. A spiral cons...
متن کاملGuarding Polyominoes, Polycubes and Polyhypercubes
We consider variations of the original art gallery problem where the domain is a polyomino, a polycube, or a polyhypercube. Anm-polyomino is the connected union of m unit squares called pixels, an m-polycube is the connected union of m unit cubes called voxels, and an m-polyhypercube is the connected union of m unit hypercubes in a d dimensional Euclidean space. In this paper we generalize and ...
متن کاملMultidimensional Impossible Polycubes
We first derive a 3-dimensional impossible polycube by forcibly deforming the projection of a 3-dimensional polycube. This procedure is extended into n(≥4)-space to construct n-dimensional impossible polycubes represented in 2or 3-space. They are useful as fundamental grid patterns for imaging various n-dimensional impossible figures in our 3-space. On 2-space, especially, each pattern can be c...
متن کاملHinged Dissection of Polyominoes and Polyforms
A hinged dissection of a set of polygons S is a collection of polygonal pieces hinged together at vertices that can be rotated into any member of S. We present a hinged dissection of all edge-to-edge gluings of n congruent copies of a polygon P that join corresponding edges of P . This construction uses kn pieces, where k is the number of vertices of P . When P is a regular polygon, we show how...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Discrete Algorithms
سال: 2018
ISSN: 1570-8667
DOI: 10.1016/j.jda.2018.11.004