727 search results - page 6 / 146 » One line and n points |
BIRTHDAY
2003
Springer
15 years 3 months ago
2003
Springer
Abstract. The problem of matching sets of points or sets of horizontal line segments in plane under translations is considered. For finding the exact occurrences of a point set of...
WADS
2007
Springer
15 years 4 months ago
2007
Springer
We study the presence of obstacles in computing BCP(s, t) (Best Coverage Path between two points s and t) in a 2D field under surveillance by sensors. Consider a set of m line seg...
CCCG
2010
14 years 11 months ago
2010
In this paper we present a polynomial time algorithm for computing a Hausdorff core of a polygon with a single reflex vertex. A Hausdorff core of a polygon P is a convex polygon Q...
ECCV
2002
Springer
15 years 11 months ago
2002
Springer
Estimation of camera pose from an image of n points or lines with known correspondence is a thoroughly studied problem in computer vision. Most solutions are iterative and depend o...
CCCG
2010
14 years 11 months ago
2010
We present a data structure for efficient axis-aligned orthogonal range search on a set of n lines in a bounded plane. The algorithm requires O(log n + k) time in the worst case t...