153 search results - page 16 / 31 » Near-linear approximation algorithms for geometric hitting s... |
162
click to vote
WADS
2007
Springer
15 years 10 months ago
2007
Springer
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...
134
click to vote
COMPGEOM
2006
ACM
15 years 9 months ago
2006
ACM
We consider a class of geometric facility location problems in which the goal is to determine a set X of disks given by their centers (tj) and radii (rj) that cover a given set of...
147
click to vote
CIARP
2004
Springer
15 years 9 months ago
2004
Springer
Geometric moments have been proven to be a very efficient tool for description and recognition of binary shapes. Numerous methods for effective calculation of image moments have be...
187
click to vote
COMPGEOM
2010
ACM
15 years 9 months ago
2010
ACM
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
129
click to vote
ICCV
2001
IEEE
16 years 5 months ago
2001
IEEE
A framework for photo-realistic view-dependent image synthesis of a shiny object from a sparse set of images and a geometric model is proposed. Each image is aligned with the 3D m...