339 search results - page 7 / 68 » Geometry of Graphs |
SPAA
1992
ACM
13 years 11 months ago
1992
ACM
An O(log n) time, n processor randomized algorithm for computing the k-nearest neighbor graph of n points in d dimensions, for fixed d and k is presented. The method is based on t...
CPAIOR
2009
Springer
14 years 2 months ago
2009
Springer
COMPGEOM
2009
ACM
14 years 2 months ago
2009
ACM
It was shown in [11] that any orientable graph of genus g can be probabilistically embedded into a graph of genus g − 1 with constant distortion. Removing handles one by one giv...
ICDAR
2005
IEEE
14 years 1 months ago
2005
IEEE
A trainable method for distinguishing between mathematics notation and natural language (here, English) in images of textlines, using computational geometry methods only with no a...
DGCI
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We give an overview of the main ideas and tools that have been employed in uncertain geometry. We show how several recognition problems in computer vision can be translat...