2251 search results - page 59 / 451 » Geometric Algorithms on CUDA |
263
click to vote
ISCSCT
2008
IEEE
16 years 12 days ago
2008
IEEE
—To rapidly and accurately search the corresponding points along scan-lines, rectification of stereo pairs are performed so that corresponding epipolar lines are parallel to the ...
155
click to vote
FSTTCS
2004
Springer
15 years 11 months ago
2004
Springer
We consider the problem of determining whether a given set S in Rn is approximately convex, i.e., if there is a convex set K ∈ Rn such that the volume of their symmetric differe...
142
click to vote
JCDCG
2004
Springer
15 years 11 months ago
2004
Springer
In this paper we discuss farthest-point problems in which a set or sequence S of n points in the plane is given in advance and can be preprocessed to answer various queries efficie...
170
click to vote
STOC
1995
ACM
15 years 9 months ago
1995
ACM
We relate the sequence of minimum bases of a matroid with linearly varying weights to three problems from combinatorial geometry: k-sets, lower envelopes of line segments, and con...
190
click to vote
CVPR
2011
IEEE
14 years 9 months ago
2011
IEEE
Modeling data by multiple low-dimensional planes is an important problem in many applications such as computer vision and pattern recognition. In the most general setting where on...