A hashing strategy for efficient k-nearest neighbors computation

Proceedings - Computer Graphics International, CGI 1999

Volumn , Issue , 1999, Pages 120-128

  Vanco, M ^a   Brunnett, G ^a   Schreiber, Th ^a  

^a Rheinland Pfälzische Technische Universität Kaiserslautern Landau   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

MOTION COMPENSATION; NEAREST NEIGHBOR SEARCH; PHOTONS; REVERSE ENGINEERING; THREE DIMENSIONAL COMPUTER GRAPHICS; TREES (MATHEMATICS);

ASYMPTOTIC COMPLEXITY; HASHING FUNCTIONS; K-NEAREST NEIGHBORS; PHOTON MAPS; REVERSE ENGINEERING PROCESS; SEARCH METHOD; SEARCH PROCESS; SEARCH STRATEGIES;

COMPUTER GRAPHICS;

EID: 0001893024     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CGI.1999.777924     Document Type: Conference Paper

References (6)

1. Bentley, J.L. and Shamos, M.I.: Divideand-conquer in multidimensional space, Proc. of the 8th Annual Symp. on Theory of Complexity, 1976, 220-230
2. Isselhard, F., Brunnett, G. and Schreiber, T.: Polyhedral approximation and first order segmentation of unstructured point set, In Proc. CGI '98, Hannover, Germany
3. Jensen, H. W.: Global illumination using photon maps, Proceedings Seventh Eurographics Workshop on Rendering, June 1996
4. Keller, A.: Quasi-Monte Carlo Methods for Photorealistic Image Synthesis, PhD-Thesis, University of Kaiserslautern, Shaker Verlag, 1997
5. O'Rourke, J.: Computational Geometry in C, Press Syndicate of the University of Cambridge, 1993
6. Ottmann, T. and Widmayer, P.: Algorithmen und Datenstrukturen, Wissenschaftsverlag, 1990