5210 search results - page 135 / 1042 » Exact geometric computation |
ECCV
2002
Springer
15 years 12 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...
ICDAR
2003
IEEE
15 years 3 months ago
2003
IEEE
A new way to detect arrows in line drawings is proposed in this paper. Our approach is based on the definition of the structure of such a symbol. Signatures of angular areas are ...
CCCG
2010
14 years 11 months ago
2010
In this paper we devise a new geometric spanner based on a generalization of the known Stable Roommates algorithm. This spanner is on the "path" between the Yao graph an...
TIT
2008
14 years 10 months ago
2008
In this paper, approximation by linear combinations of an increasing number n of computational units with adjustable parameters (such as perceptrons and radial basis functions) is ...
COMPGEOM
2009
ACM
15 years 4 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...