26 citations · 147 across the 54 of their papers we have counts for
5 papers · 1 filter
Multidimensional Scaling: Approximation and Complexity
Erik Demaine, Adam Hesterberg, Frederic Koehler +2
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 th…
Yin-Yang Puzzles are NP-complete
Erik D. Demaine, Jayson Lynch, Mikhail Rudoy +1
We prove NP-completeness of Yin-Yang / Shiromaru-Kuromaru pencil-and-paper puzzles. Viewed as a graph partitioning problem, we prove NP-completeness of partitioning a rectangular g…
Edge-Unfolding Prismatoids: Tall or Rectangular Base
Vincent Bian, Erik Demaine, Rachana Madhukara
We show how to edge-unfold a new class of convex polyhedra, specifically a new class of prismatoids (the convex hull of two parallel convex polygons, called the top and base), by c…
Continuous Flattening of All Polyhedral Manifolds using Countably Infinite Creases
Zachary Abel, Erik D. Demaine, Martin L. Demaine +4
We prove that any finite polyhedral manifold in 3D can be continuously flattened into 2D while preserving intrinsic distances and avoiding crossings, answering a 19-year-old open p…
Snipperclips: Cutting Tools into Desired Polygons using Themselves
Zachary Abel, Hugo Akitaya, Man-Kwun Chiu +7
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…