214 search results - page 6 / 43 » Computing the Closest Point to a Circle |
FOCS
2005
IEEE
14 years 1 months ago
2005
IEEE
In the CLOSEST SUBSTRING problem k strings s1, ..., sk are given, and the task is to find a string s of length L such that each string si has a consecutive substring of length L ...
ICCV
2005
IEEE
14 years 9 months ago
2005
IEEE
The geometry of plane-based calibration methods is well understood, but some user interaction is often needed in practice for feature detection. This paper presents a fully automa...
TALG
2008
13 years 7 months ago
2008
We present simple, fully dynamic and kinetic data structures, which are variants of a dynamic two-dimensional range tree, for maintaining the closest pair and all nearest neighbors...
GMP
2000
IEEE
13 years 12 months ago
2000
IEEE
An algorithm for calculating the minimum distance between non-convex polyhedra is described. A polyhedron is represented by a set of triangles. In calculating the distance between...
ICIAR
2004
Springer
14 years 26 days ago
2004
Springer
We present a simple calibration method for computing the extrinsic parameters (pose) and intrinsic parameters (focal length and principal point) of a camera by imaging a pattern of...