Sciweavers

17 search results - page 2 / 4
» The number of points in a matroid with no n-point line as a ...
Sort
View
ENDM
2008
81views more  ENDM 2008»
13 years 5 months ago
The maximum number of halving lines and the rectilinear crossing number of Kn for n
For n 27 we present exact values for the maximum number h(n) of halving lines and h(n) of halving pseudolines, determined by n points in the plane. For this range of values of n ...
Bernardo M. Ábrego, Silvia Fernández...
ECCV
2002
Springer
14 years 7 months ago
Linear Pose Estimation from Points or Lines
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...
Adnan Ansar, Konstantinos Daniilidis
COMPGEOM
2004
ACM
13 years 10 months ago
On empty convex polygons in a planar point set
Let P be a set of n points in general position in the plane. Let Xk(P ) denote the number of empty convex k-gons determined by P. We derive, using elementary proof techniques, sev...
Rom Pinchasi, Rados Radoicic, Micha Sharir
COMPGEOM
2009
ACM
13 years 12 months ago
Halving lines and measure concentration in the plane
Given a set of n points in the plane and a collection of k halving lines of P â„“1, . . . , â„“k indexed according to the increasing order of their slopes, we denote by d(â„“j, â„...
Rom Pinchasi
COCOON
2007
Springer
13 years 9 months ago
An Improved Algorithm for Online Unit Clustering
Abstract. We revisit the online unit clustering problem in one dimension which we recently introduced at WAOA'06: given a sequence of n points on the line, the objective is to...
Hamid Zarrabi-Zadeh, Timothy M. Chan