1885 search results - page 10 / 377 » Distance Map Retrieval |
AAIM
2009
Springer
15 years 4 months ago
2009
Springer
We develop algorithms to compute Voronoi diagrams, shortest path maps, and the Fr´echet distance in the plane with polygonal obstacles. Distances between points are measured eithe...
CVPR
1998
IEEE
15 years 11 months ago
1998
IEEE
The Euclidean skeleton is essential for general shape representation. This paper provides an e cient method to extract a well-connected Euclidean skeleton by a neighbor bisector d...
75
Voted
DGCI
2006
Springer
15 years 1 months ago
2006
Springer
A sequential algorithm for computing the distance map using distances based on neighbourhood sequences (of any length) in the 2D square grid; and 3D cubic, face-centered cubic, and...
70
Voted
CIBCB
2005
IEEE
15 years 3 months ago
2005
IEEE
— With the invention of high throughput methods, researchers are capable of producing large amounts of biological data. During the analysis of such data, the need for a functiona...
JDCTA
2010
14 years 4 months ago
2010
To manage the complicated data such as recursive elements, multiply namespaces, repeatable structures, extended elements and attributes in the XML Binding documents of distance ed...