Given a set of n points in the plane, we show how to compute various enclosing isosceles triangles where different parameters such as area or perimeter are optimized. We then stud...
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. ...
We propose four simple algorithms for routing on planar graphs using virtual coordinates. These algorithms are superior to existing algorithms in that they are oblivious, work als...
We study the following geometric probing problem: Reconstruct a planar polygon from its intersections with a collection of arbitrarily-oriented "cutting" lines. We propo...