19 search results - page 1 / 4 » The Ordinary Line Problem Revisited |
CCCG
2007
13 years 6 months ago
2007
Let P be a set of n points in the plane. A connecting line of P is a line that passes through at least two of its points. A connecting line is called ordinary if it is incident on...
CVPR
2006
IEEE
14 years 6 months ago
2006
IEEE
In this paper we propose a practical and efficient method for finding the globally optimal solution to the problem of pose estimation of a known object. We present a framework tha...
NETWORKS
2006
13 years 4 months ago
2006
We are given a directed network G = (V, A, u) with vertex set V , arc set A, a source vertex s V , a destination vertex t V , a finite capacity vector u = {uij}ijA, and a positi...
COMPGEOM
2010
ACM
13 years 9 months ago
2010
ACM
Let B be a collection of n arbitrary balls in R3 . We establish an almost-tight upper bound of O(n3+ε ), for any ε > 0, on the complexity of the space F(B) of all the lines t...
BMVC
2000
13 years 6 months ago
2000
The objective of this paper is to estimate the orientation of a scene plane from an uncalibrated perspective image under the assumption that the scene is coated with a homogeneous...