13 search results - page 1 / 3 » Largest and Smallest Convex Hulls for Imprecise Points |
ALGORITHMICA
2010
13 years 5 months ago
2010
Assume that a set of imprecise points is given, where each point is specified by a region in which the point may lie. We study the problem of computing the smallest and largest pos...
WAOA
2007
Springer
13 years 11 months ago
2007
Springer
WADS
2007
Springer
13 years 11 months ago
2007
Springer
CORR
2011
Springer
12 years 8 months ago
2011
Springer
Motivated by the desire to cope with data imprecision [8], we study methods for preprocessing a set of planar regions such that whenever we are given a set of points, each of whic...
ICPP
2002
IEEE
13 years 9 months ago
2002
IEEE
We develop efficient algorithms for problems in computational geometry—convex hull, smallest enclosing box, ECDF, two-set dominance, maximal points, all-nearest neighbor, and c...