2342 search results - page 69 / 469 » Sublinear geometric algorithms |
FSTTCS
2004
Springer
15 years 6 months ago
2004
Springer
We consider the problem of determining whether a given set S in Rn is approximately convex, i.e., if there is a convex set K ∈ Rn such that the volume of their symmetric differe...
JCDCG
2004
Springer
15 years 6 months ago
2004
Springer
In this paper we discuss farthest-point problems in which a set or sequence S of n points in the plane is given in advance and can be preprocessed to answer various queries efficie...
122
click to vote
STOC
1995
ACM
15 years 4 months ago
1995
ACM
We relate the sequence of minimum bases of a matroid with linearly varying weights to three problems from combinatorial geometry: k-sets, lower envelopes of line segments, and con...
121
Voted
CVPR
2011
IEEE
14 years 4 months ago
2011
IEEE
Modeling data by multiple low-dimensional planes is an important problem in many applications such as computer vision and pattern recognition. In the most general setting where on...
154
Voted
ICCV
2011
IEEE
14 years 21 days ago
2011
IEEE
In this paper, we propose an efficient technique to detect changes in the geometry of an urban environment using some images observing its current state. The proposed method can ...