137 search results - page 17 / 28 » Maintaining the Approximate Width of a Set of Points in the ... |
COMGEO
2004
ACM
13 years 7 months ago
2004
ACM
Dot maps--drawings of point sets--are a well known cartographic method to visualize density functions over an area. We study the problem of simplifying a given dot map: given a se...
CCCG
1993
13 years 8 months ago
1993
A k-dense corridor through a finite set, S, of n points in the plane is the open region of the plane that is bounded by two parallel lines that intersect the convex hull of S and ...
IPPS
2009
IEEE
14 years 2 months ago
2009
IEEE
We investigate the problem of converting sets of sensors into strongly connected networks of sensors using multiple directional antennae. Consider a set S of n points in the plane...
COMGEO
2008
ACM
13 years 7 months ago
2008
ACM
We consider algorithms for finding the optimal location of a simple transportation device, that we call a moving walkway, consisting of a pair of points in the plane between which ...
IJCAI
2003
13 years 8 months ago
2003
This paper introduces the Point-Based Value Iteration (PBVI) algorithm for POMDP planning. PBVI approximates an exact value iteration solution by selecting a small set of represen...