214 search results - page 3 / 43 » Computing the Closest Point to a Circle |
IJCGA
2002
13 years 5 months ago
2002
Given a set P of n points in the plane, the two-circle point-labeling problem consists of placing 2n uniform, non-intersecting, maximum-size open circles such that each point touc...
DCG
1998
13 years 5 months ago
1998
Given a set of points S = fp1; : : : ; png in Euclidean d-dimensional space, we address the problem of computing the d-dimensional annulus of smallest width containing the set. We...
ICPR
2006
IEEE
14 years 7 months ago
2006
IEEE
We present a new method to perform reliable matching between different images. This method finds complete region correspondences between concentric circles and the corresponding p...
CCCG
2007
13 years 7 months ago
2007
Here we propose an efficient algorithm for computing the smallest enclosing circle whose center is constrained to lie on a query line segment. Our algorithm preprocesses a given s...
EDBT
2008
ACM
14 years 6 months ago
2008
ACM
We introduce a novel spatial join operator, the ring-constrained join (RCJ). Given two sets P and Q of spatial points, the result of RCJ consists of pairs p, q (where p P, q Q) ...