Zobrazeno 1 - 10
of 75
pro vyhledávání: '"Hesterberg, Adam"'
Autor:
MIT CompGeom Group, Akitaya, Hugo A., Demaine, Erik D., Hesterberg, Adam, Lubiw, Anna, Lynch, Jayson, O'Rourke, Joseph, Stock, Frederick, Tkadlec, Josef
A polyiamond is a polygon composed of unit equilateral triangles, and a generalized deltahedron is a convex polyhedron whose every face is a convex polyiamond. We study a variant where one face may be an exception. For a convex polygon P, if there is
Externí odkaz:
http://arxiv.org/abs/2408.04687
Autor:
MIT CompGeom Group, Akitaya, Hugo A., Demaine, Erik D., Hesterberg, Adam, Lubiw, Anna, Lynch, Jayson, O'Rourke, Joseph, Stock, Frederick
We explore an Art Gallery variant where each point of a polygon must be seen by k guards, and guards cannot see through other guards. Surprisingly, even covering convex polygons under this variant is not straightforward. For example, covering every p
Externí odkaz:
http://arxiv.org/abs/2404.04613
Autor:
MIT CompGeom Group, Abel, Zachary, Akitaya, Hugo A., Demaine, Erik D., Hesterberg, Adam C., Lynch, Jayson
This paper characterizes when an $m \times n$ rectangle, where $m$ and $n$ are integers, can be tiled (exactly packed) by squares where each has an integer side length of at least 2. In particular, we prove that tiling is always possible when both $m
Externí odkaz:
http://arxiv.org/abs/2308.15317
Metric Multidimensional scaling (MDS) is a classical method for generating meaningful (non-linear) low-dimensional embeddings of high-dimensional data. MDS has a long history in the statistics, machine learning, and graph drawing communities. In part
Externí odkaz:
http://arxiv.org/abs/2109.11505
Autor:
Abel, Zachary, Akitaya, Hugo, Chiu, Man-Kwun, Demaine, Erik D., Demaine, Martin L., Hesterberg, Adam, Korman, Matias, Lynch, Jayson, van Renssen, André, Roeloffzen, Marcel
We study Snipperclips, a computer puzzle game whose objective is to create a target shape with two tools. The tools start as constant-complexity shapes, and each tool can snip (i.e., subtract its current shape from) the other tool. We study the compu
Externí odkaz:
http://arxiv.org/abs/2105.08305
Autor:
Akitaya, Hugo A., Demaine, Erik D., Gonczi, Andrei, Hendrickson, Dylan H., Hesterberg, Adam, Korman, Matias, Korten, Oliver, Lynch, Jayson, Parada, Irene, Sacristán, Vera
We give both efficient algorithms and hardness results for reconfiguring between two connected configurations of modules in the hexagonal grid. The reconfiguration moves that we consider are "pivots", where a hexagonal module rotates around a vertex
Externí odkaz:
http://arxiv.org/abs/2012.07556
Autor:
Alcock, Leo, Asif, Sualeh, Bosboom, Jeffrey, Brunner, Josh, Chen, Charlotte, Demaine, Erik D., Epstein, Rogers, Hesterberg, Adam, Hirschfeld, Lior, Hu, William, Lynch, Jayson, Scheffler, Sarah, Zhang, Lillian
When can $n$ given numbers be combined using arithmetic operators from a given subset of $\{+, -, \times, \div\}$ to obtain a given target number? We study three variations of this problem of Arithmetic Expression Construction: when the expression (1
Externí odkaz:
http://arxiv.org/abs/2011.11767
Autor:
Asif, Sualeh, Coulombe, Michael, Demaine, Erik D., Demaine, Martin L., Hesterberg, Adam, Lynch, Jayson, Singhal, Mihir
We prove that the classic falling-block video game Tetris (both survival and board clearing) remains NP-complete even when restricted to 8 columns, or to 4 rows, settling open problems posed over 15 years ago [BDH+04]. Our reduction is from 3-Partiti
Externí odkaz:
http://arxiv.org/abs/2009.14336
A closed quasigeodesic is a closed curve on the surface of a polyhedron with at most $180^\circ$ of surface on both sides at all points; such curves can be locally unfolded straight. In 1949, Pogorelov proved that every convex polyhedron has at least
Externí odkaz:
http://arxiv.org/abs/2008.00589
Autor:
Chiu, Man-Kwun, Demaine, Erik D., Diomidova, Jenny, Eppstein, David, Hearn, Robert A., Hesterberg, Adam, Korman, Matias, Parada, Irene, Rudoy, Mikhail
Given a set of point sites, a sona drawing is a single closed curve, disjoint from the sites and intersecting itself only in simple crossings, so that each bounded region of its complement contains exactly one of the sites. We prove that it is NP-har
Externí odkaz:
http://arxiv.org/abs/2007.15784