On a nearest-neighbour problem in minkowski and power metrics

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2073, Issue , 2001, Pages 663-672

  Gavrilova, M L ^a  

^a UNIVERSITY OF CALGARY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL GEOMETRY; GRAPHIC METHODS;

ALGORITHM FOR SOLVING; GENERALIZED VORONOI DIAGRAM; NEAREST NEIGHBORS; NEAREST NEIGHBOUR; POWER METRICS; QUERY POINTS; TREE METHOD; VORONOI DIAGRAM METHOD;

NEAREST NEIGHBOR SEARCH;

EID: 84949653180     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45545-0_77     Document Type: Conference Paper

References (17)

1. Aggarwal, P., Raghawan, P. Deferred data structures for the nearest-neighbor problem, Inform. Process. Letters 40 (3) (1991) 119-122.
2. Bentley J. L. K − d Trees for Semidynamic Point Sets, in Proceedings of the 6th Annual ACM Symposium on Computational Geometry (1990) 187-197.
3. Berchtold, S., Ertl, B., Keirn, D., Kriegel, H.P., Seidel, T. Fast nearest neighbor search in high-dimensional space, in Proc. of the 14th Intn. Conf. On Data Emg, Orlando, Florida (1998).
4. Devillers, O., Golin, M., Kedem, K., Schirra, S. Queries on Voronoi Diagrams of Moving Points, Comput. Geom. Theory and Applic. 6 (1996) 315-327.
5. Edelsbrunner, H., Shah, N. Incremental topological flipping works for regular triangulations, Algorithmica 15 (1996) 223-241.
6. Friedman, J., Bentley, J., Finkel, R. An Algorithm for Finding Best Matches in Logarithmic Expected Time, ACM Transactions on Mathematical Software, 3(3) (1977) 209-226.
7. Gavrilov, D., Vinogradov, O. A cluster in granular systems as a topologically vari- able structure, in Proc. of 1997 ASCE Symposium on Mechanics of Deformation and Flow of Particulate Materials, Evanston, IL (1997) 299-307.
8. Gavrilova, M. Proximity and Applications in General Metrics Ph. D. Thesis, Dept. of Computer Science, University of Calgary, Canada (1999).
9. Gavrilova, M., Rokne, J., Vinogradov O and Gavrilov D. Collision detection algorithms in simulation of granular materials, 1999 ASME Mechanics and Materials Conference, (1999) 283-284.
10. Graf, T., Hinrichs, K. A Plane-Sweep Algorithm for the All-Nearest-Neighbors Problem for a Set of Convex Planar Objects, in Proc. 3rd Works. Algm. Data Struct., LNCS, Springer-Verlag 709 (1993) 349-360.
11. Luchnikov, V.A., Medvedev, N.N., Voloshin, V.P., Geiger, A. Simulation of trans- port and diffusion of the Voronoi network, in the book: Scientific Computing in Chemical Engineering, Springer-Verlag, Berlin, (1999).
12. Medvedev, N.N. Voronoi-Delaunay Method for Non-crystalline Structures, SB Russian academy of Science, Novosibirsk (in Russian) (2000).
13. Murphy, M., Skiena, S. A study of data structures for orthogonal range and nearest neighbor queries in high dimensional spaces, CSE 523/524 Master's Project, Department of Computer Science, SUNYSB (1996).
14. Okabe, A., Boots, B., Sugihara, K. Spatial Tessellations: Concepts and Applications of Voronoi Diagrams. John Wiley & Sons, Chichester, England (1992).
15. O'Rourke, J. Computational geometry in C. Cambridge Univ. Press (1994)
16. Schaudt, B., Drysdale, R. Higher-dimensional Voronoi diagrams for convex dis- tance functions," in Proc. of the 4th Can. Conf. on Comp. Geometry (1992) 274-279.
17. Shinoda, W., Okazaki, S. A Voronoi analysis of lipid area fluctuation in a bilayer J. Chem. Phys. V. 109(4) (1998) 1517-1521.