Sciweavers

1245 search results - page 39 / 249
» Triangulation for Points on Lines
Sort
View
ISVC
2010
Springer
14 years 7 months ago
3D Camera Pose Estimation Using Line Correspondences and 1D Homographies
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...
COMGEO
2010
ACM
14 years 9 months ago
Pointed binary encompassing trees: Simple and optimal
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...
72
Voted
CORR
2008
Springer
90views Education» more  CORR 2008»
14 years 9 months ago
Communication-Efficient Construction of the Plane Localized Delaunay Graph
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...
COMGEO
2006
ACM
14 years 9 months ago
A result about the density of iterated line intersections in the plane
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...
Christopher J. Hillar, Darren L. Rhea
80
Voted
CCCG
2010
14 years 11 months ago
Towards a dynamic data structure for efficient bounded line range search
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...
Thuy Le, Bradford G. Nickerson