We study the problem of computing the set of all distant horizons of a terrain, represented as either: the set of all edges that appear in the set of all distant horizons; the con...
William S. Evans, Daniel Archambault, David G. Kir...
We investigate a question initiated in the work of Sibley and Wagon, who proved that 3 colors suffice to color any collection of 2D parallelograms glued edge-to-edge. Their proof ...
We propose a definition of locality for properties of geometric graphs. We measure the local density of graphs using region-counting distances [8] between pairs of vertices, and w...
We prove that any given well-behaved folded state of a piece of paper can be reached via a continuous folding process starting from the unfolded paper and ending with the folded st...
Erik D. Demaine, Satyan L. Devadoss, Joseph S. B. ...