Sciweavers

2342 search results - page 47 / 469
» Sublinear geometric algorithms
Sort
View
SODA
1994
ACM
138views Algorithms» more  SODA 1994»
14 years 14 days ago
Average Case Analysis of Dynamic Geometric Optimization
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...
David Eppstein
PAMI
2007
214views more  PAMI 2007»
13 years 10 months ago
Tracking Deforming Objects Using Particle Filtering for Geometric Active Contours
—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...
Yogesh Rathi, Namrata Vaswani, Allen Tannenbaum, A...
CG
2002
Springer
13 years 11 months ago
Towards robust broadcasting of geometry data
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...
Stephan Bischoff, Leif Kobbelt
STOC
2010
ACM
245views Algorithms» more  STOC 2010»
14 years 4 months ago
Weighted Geometric Set Cover via Quasi-Uniform Sampling
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 ...
Kasturi Varadarajan
JVCIR
2006
85views more  JVCIR 2006»
13 years 11 months ago
Combining geometrical and textured information to perform image classification
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...
Jean-François Aujol, Tony F. Chan