214 search results - page 4 / 43 » Computing the Closest Point to a Circle |
IJCV
2006
13 years 7 months ago
2006
The computation of a rigid body transformation which optimally aligns a set of measurement points with a surface and related registration problems are studied from the viewpoint o...
ICPR
2008
IEEE
14 years 8 months ago
2008
IEEE
A framework for mapping a polar-like coordinate system to a non-rigid shape is presented. Using a graph pyramid, a binary shape is decomposed into connected parts, based on its st...
COMPGEOM
2007
ACM
13 years 11 months ago
2007
ACM
The Bentley-Ottmann (BO) algorithm, initially designed to report the intersection points of line-segments in the plane, is the prototypical sweep-line algorithm. This video presen...
CAD
2006
Springer
13 years 7 months ago
2006
Springer
Presented in this paper is a sweepline algorithm to compute the Voronoi diagram of a set of circles in a two-dimensional Euclidean space. The radii of the circles are non-negative...
IPL
2002
13 years 7 months ago
2002
Given a planar point set, we wish to label the points with uniform circular labels such that each input point lies on the boundary of two labels, none of the interiors of the labe...