557 search results - page 43 / 112 » On the set multi-cover problem in geometric settings |
DICTA
2003
13 years 10 months ago
2003
This paper describes a novel approach to the problem of recovering information from an image set by comparing the radiance of hypothesised point correspondences. This method is app...
COMPGEOM
2010
ACM
14 years 2 months ago
2010
ACM
Let P be a set of n points in R3 . The 2-center problem for P is to find two congruent balls of the minimum radius whose union covers P. We present two randomized algorithms for ...
IWCIA
2004
Springer
14 years 2 months ago
2004
Springer
We consider selected geometric properties of 2D or 3D sets, given in form of binary digital pictures, and discuss their estimation. The properties examined are perimeter and area i...
CAD
2005
Springer
13 years 9 months ago
2005
Springer
Point-based geometric models are gaining popularity in both the computer graphics and CAD fields. A related design/modelling problem is the focus of the reported research: drawing...
JACM
2010
13 years 7 months ago
2010
We present a fully dynamic randomized data structure that can answer queries about the convex hull of a set of n points in three dimensions, where insertions take O(log3 n) expect...