Sciweavers

103 search results - page 13 / 21
» The equitable location problem on the plane
Sort
View
DCOSS
2009
Springer
15 years 4 months ago
Cheap or Flexible Sensor Coverage
We consider dual classes of geometric coverage problems, in which disks, corresponding to coverage regions of sensors, are used to cover a region or set of points in the plane. The...
Amotz Bar-Noy, Theodore Brown, Matthew P. Johnson,...
SG
2009
Springer
15 years 4 months ago
A Rendering Method for 3D Origami Models Using Face Overlapping Relations
When we construct a model of origami (a model of a folded sheet of paper) in a computer, it is usual to represent the model as a set of polygons having zero thickness. One of the t...
Yohsuke Furuta, Jun Mitani, Yukio Fukui
COR
2006
94views more  COR 2006»
14 years 10 months ago
Computing obnoxious 1-corner polygonal chains
We consider an obnoxious facility location problem in which the facility is a trajectory consisting of a bounded length polygonal chain of two edges having extremes anchored at tw...
José Miguel Díaz-Báñez...
TROB
2008
96views more  TROB 2008»
14 years 9 months ago
On Discrete-Time Pursuit-Evasion Games With Sensing Limitations
We address discrete-time pursuit-evasion games in the plane where every player has identical sensing and motion ranges restricted to closed discs of given sensing and stepping rad...
Shaunak Dattaprasad Bopardikar, Francesco Bullo, J...
IPSN
2010
Springer
15 years 4 months ago
Covering space for in-network sensor data storage
For in-network storage schemes, one maps data, indexed in a logical space, to the distributed sensor locations. When the physical sensor network has an irregular shape and possibl...
Rik Sarkar, Wei Zeng, Jie Gao, Xianfeng David Gu