2 citations · 2 across the 4 of their papers we have counts for
4 papers · 1 filter
On the continuous Fermat-Weber problem
Sandor P. Fekete, Joseph S. B. Mitchell, Karin Beurer
We give the first exact algorithmic study of facility location problems that deal with finding a median for a continuum of demand points. In particular, we consider versions of the…
On the Reflexivity of Point Sets
Esther M. Arkin, Sandor P. Fekete, Ferran Hurtado +4
We introduce a new measure for planar point sets S that captures a combinatorial distance that S is from being a convex set: The reflexivity rho(S) of S is given by the smallest nu…
An Algorithmic Study of Manufacturing Paperclips and Other Folded Structures
Esther M. Arkin, Sandor P. Fekete, Joseph S. B. Mitchell
We study algorithmic aspects of bending wires and sheet metal into a specified structure. Problems of this type are closely related to the question of deciding whether a simple non…
When Can You Fold a Map?
Esther M. Arkin, Michael A. Bender, Erik D. Demaine +4
We explore the following problem: given a collection of creases on a piece of paper, each assigned a folding direction of mountain or valley, is there a flat folding by a sequence…