2342 search results - page 20 / 469 » Sublinear geometric algorithms |
ECCV
2002
Springer
14 years 9 months ago
2002
Springer
Over the last decade, a number of methods for geometric matching based on a branch-and-bound approach have been proposed. Such algorithms work by recursively subdividing transforma...
IJCAI
2003
13 years 9 months ago
2003
The structural rigidity property, a generalization of Laman’s theorem which characterizes rigid bar frameworks in 2D, is generally considered a good approximation of rigidity in...
COMPGEOM
2009
ACM
14 years 2 months ago
2009
ACM
Given a set system (X, R), the hitting set problem is to find a smallest-cardinality subset H ⊆ X, with the property that each range R ∈ R has a non-empty intersection with H...
JNW
2007
13 years 7 months ago
2007
— This paper presented a fully distributed algorithm to compute a planar subgraph of the underlying wireless connectivity graph. This work considered the idealized unit disk grap...
MICCAI
2003
Springer
14 years 8 months ago
2003
Springer
Abstract. Interpolation of field data from unstructured meshes requires the potentially expensive identification of the finite element or volume within which the interpolating poin...