2 citations · 3 across the 3 of their papers we have counts for
3 papers · 1 filter
Minimum feature size preserving decompositions
Greg Aloupis, Erik D. Demaine, Martin L. Demaine +2
The minimum feature size of a crossing-free straight line drawing is the minimum distance between a vertex and a non-incident edge. This quantity measures the resolution needed to…
Detecting all regular polygons in a point set
Greg Aloupis, Jean Cardinal, Sebastien Collette +2
In this paper, we analyze the time complexity of finding regular polygons in a set of n points. We combine two different approaches to find regular polygons, depending on their num…
Continuous Blooming of Convex Polyhedra
Erik D. Demaine, Martin L. Demaine, Vi Hart +3
We construct the first two continuous bloomings of all convex polyhedra. First, the source unfolding can be continuously bloomed. Second, any unfolding of a convex polyhedron can b…