133 search results - page 4 / 27 » On the distinct distances determined by a planar point set |
GIS
2008
ACM
14 years 10 months ago
2008
ACM
An index is devised to support position-independent search for images containing quartets of icons. Point quartets exist that do not unambiguously map to quadrilaterals, however, ...
IJIG
2008
13 years 9 months ago
2008
The Perspective-N-Point problem (PNP) is a notable problem in computer vision. It consists in, given N points known in an object coordinate space and their projection onto the ima...
CORR
2011
Springer
13 years 25 days 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...
CCCG
2010
13 years 10 months ago
2010
A planar point set S is an (i, t) set of ghost chimneys if there exist lines H0, H1, . . . , Ht-1 such that the orthogonal projection of S onto Hj consists of exactly i + j distin...
CVPR
2007
IEEE
14 years 11 months ago
2007
IEEE
The task of registering video frames with a static model is a common problem in many computer vision domains. The standard approach to registration involves finding point correspo...