EOR
2007
13 years 11 months ago
2007
This paper considers the problem of locating M facilities on the unit square so as to minimize the maximal demand faced by each facility subject to closest assignments and coverag...
IM
2008
13 years 11 months ago
2008
Let G = G(n, r) be a random geometric graph resulting from placing n nodes uniformly at random in the unit square (disk) and connecting every two nodes if and only if their Euclide...
DGCI
2006
Springer
14 years 3 months ago
2006
Springer
This paper explores proofs of the isoperimetric inequality for 4-connected shapes on the integer grid Z2 , and its geometric meaning. Pictorially, we discuss ways to place a maxima...
ICCSA
2004
Springer
14 years 5 months ago
2004
Springer
We propose Inflate-Paste – a new technique for generating orthogonal polygons with a given number of vertices from a unit square based on gluing rectangles. It is dual to Inflate...