1728 search results - page 112 / 346 » The Accelerated Euclidean Algorithm |
105
click to vote
ICIP
2004
IEEE
16 years 4 months ago
2004
IEEE
In this paper, we first apply the theory of wallpaper groups to natural images and extract a novel feature to depict the symmetry property of natural images. The original proposed...
125
click to vote
VMV
2007
15 years 4 months ago
2007
This article focuses on algorithms for fast computation of the Euclidean distance between a query point and a subdivision surface. The analyzed algorithms include uniform tessella...
139
click to vote
IPL
2008
15 years 2 months ago
2008
We consider the problem of computing shortest paths in three-dimensions in the presence of a single-obstacle polyhedral terrain, and present a new algorithm that for any p 1, comp...
121
click to vote
STOC
2002
ACM
16 years 3 months ago
2002
ACM
Most research on nearest neighbor algorithms in the literature has been focused on the Euclidean case. In many practical search problems however, the underlying metric is non-Eucl...
123
click to vote
COMPGEOM
2004
ACM
15 years 8 months ago
2004
ACM
We revisit the problem of computing shortest obstacle-avoiding paths among obstacles in three dimensions. We prove new hardness results, showing, e.g., that computing Euclidean sh...