19 citations · 66 across the 26 of their papers we have counts for
3 papers · 1 filter
Folding Polyominoes into (Poly)Cubes
Oswin Aichholzer, Michael Biro, Erik D. Demaine +6
We study the problem of folding a polyomino into a polycube , allowing faces of to be covered multiple times. First, we define a variety of folding models according to w…
The Painter's Problem: covering a grid with colored connected polygons
Arthur van Goethem, Irina Kostitsyna, Marc van Kreveld +3
Motivated by a new way of visualizing hypergraphs, we study the following problem. Consider a rectangular grid and a set of colors . Each cell in the grid is assigned a subs…
Self-approaching paths in simple polygons
Prosenjit Bose, Irina Kostitsyna, Stefan Langerman
We study self-approaching paths that are contained in a simple polygon. A self-approaching path is a directed curve connecting two points such that the Euclidean distance between a…