activity
20022011
most citedShawn: A new approach to simulating wireless sensor networks

88 citations · 251 across the 29 of their papers we have counts for

collaborators
Showing cs.CGShow all

6 papers · 1 filter

cs.CG2008

Staged Self-Assembly:Nanomanufacture of Arbitrary Shapes with O(1) Glues

Erik D. Demaine, Martin L. Demaine, Sandor P. Fekete +4

We introduce staged self-assembly of Wang tiles, where tiles can be added dynamically in sequence and where intermediate constructions can be stored for later mixing. This model an…

cs.CG20032 cited

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…

cs.CG2003

Minimizing the stabbing number of matchings, trees, and triangulations

Sandor P. Fekete, Marco Luebbecke, Henk Meijer

The (axis-parallel) stabbing number of a given set of line segments is the maximum number of segments that can be intersected by any one (axis-parallel) line. This paper deals with…

cs.CG20035 cited

The one-round Voronoi game replayed

Sandor P. Fekete, Henk Meijer

We consider the one-round Voronoi game, where player one (``White'', called ``Wilma'') places a set of n points in a rectangular area of aspect ratio r <=1, followed by the second…

cs.CG2002

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…

cs.CG2002

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…