2 citations · 2 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…
An O(n log n)-Time Algorithm for the Restricted Scaffold Assignment
Justin Colannino, Mirela Damian, Ferran Hurtado +4
The assignment problem takes as input two finite point sets S and T and establishes a correspondence between points in S and points in T, such that each point in S maps to exactly…