2342 search results - page 47 / 469 » Sublinear geometric algorithms |
106
Voted
SODA
1994
ACM
15 years 1 months ago
1994
ACM
We maintain the maximum spanning tree of a planar point set, as points are inserted or deleted, in O(log3 n) time per update in Mulmuley's expected-case model of dynamic geom...
136
Voted
PAMI
2007
15 years 3 days ago
2007
—Tracking deforming objects involves estimating the global motion of the object and its local deformations as a function of time. Tracking algorithms using Kalman filters or part...
94
Voted
CG
2002
Springer
15 years 13 days ago
2002
Springer
We present new algorithms for the robust transmission of geometric data sets, i.e. transmission which allows the receiver to recover (an approximation of) the original geometric o...
117
click to vote
STOC
2010
ACM
15 years 5 months ago
2010
ACM
There has been much progress on geometric set cover problems, but most known techniques only apply to the unweighted setting. For the weighted setting, very few results are known ...
100
Voted
JVCIR
2006
15 years 17 days ago
2006
In this paper, we propose a framework to carry out supervised classification of images containing both textured and non textured areas. Our approach is based on active contours. U...