137 search results - page 8 / 28 » Maintaining the Approximate Width of a Set of Points in the ... |
IPCO
2001
13 years 8 months ago
2001
Problem (Extended Abstract) Cliff Stein David P. Wagner Dartmouth College Computer Science Technical Report TR2000-367 May 9, 2000 The problem of traversing a set of points in the...
COMGEO
1999
ACM
13 years 7 months ago
1999
ACM
This paper discusses algorithms for labeling sets of points in the plane, where labels are not restricted to some finite number of positions. We show that continuously sliding lab...
COMPGEOM
2009
ACM
14 years 1 months ago
2009
ACM
We consider the problem of computing minimum geometric hitting sets in which, given a set of geometric objects and a set of points, the goal is to compute the smallest subset of p...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
In many physical statistical, biological and other investigations it is desirable to approximate a system of points by objects of lower dimension and/or complexity. For this purpo...
GD
2007
Springer
14 years 1 months ago
2007
Springer
In John Tantalo’s on-line game Planarity the player is given a non-plane straight-line drawing of a planar graph. The aim is to make the drawing plane as quickly as possible by m...