Abstract. This paper describes a new method for matching line segments between two images in order to compute the relative camera pose. This approach improves the camera pose for i...
Irene Reisner-Kollmann, Andreas Reichinger, Werner...
For n disjoint line segments in the plane we construct in optimal O(n log n) time and linear space an encompassing tree of maximum degree three such that at every vertex all incid...
Michael Hoffmann, Bettina Speckmann, Csaba D. T&oa...
Let V be a finite set of points in the plane. We present a 2-local algorithm that constructs a plane 4 3 9 -spanner of the unit-disk graph UDG(V ). This algorithm makes only one ...
Prosenjit Bose, Paz Carmi, Michiel H. M. Smid, Dam...
Let S be a finite set of points in the plane and let T (S) be the set of intersection points between pairs of lines passing through any two points in S. We characterize all configu...
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...