727 search results - page 26 / 146 » One line and n points |
201
Voted
GIS
2008
ACM
16 years 1 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, ...
98
Voted
CVPR
1997
IEEE
15 years 4 months ago
1997
IEEE
We describe a linear algorithm to recover 30 afJine slzape/niotionfrom line correspondences over three views with uncalibrated afine cameras. The key idea is the introduction of a...
COMPGEOM
2001
ACM
15 years 4 months ago
2001
ACM
This paper addresses the problem of lossy compression of arrangements. Given an arrangement of n lines in the plane, we show how to construct another arrangement consisting of man...
102
click to vote
IPL
2002
15 years 3 days ago
2002
An algorithm, described by Sedgewick, finds the distance between the closest pair of n given points in a plane using a variant of mergesort. This takes O(n log n) time. To prove t...
WADS
2007
Springer
15 years 6 months ago
2007
Springer
We present new asymptotically tight bounds on cuttings, a fundamental data structure in computational geometry. For n objects in space and a parameter r ∈ N, an 1 r -cutting is ...