It’s okay to be skinny, if your friends are fat∗ Songrit Maneewongvatana and David M. Mount Department of Computer Science

First Page		Document Content
Date: 2005-02-05 14:46:09 Search algorithms K-d tree R-tree Nearest neighbor search Space partitioning K-nearest neighbor algorithm Binary space partitioning Hypercube Quadtree Information science Geometry Mathematics		It’s okay to be skinny, if your friends are fat∗ Songrit Maneewongvatana and David M. Mount Department of Computer Science Add to Reading List Source URL: www.cs.umd.edu Download Document from Source Website File Size: 181,79 KB Share Document on Facebook

	A Reactive Data Structure for Geographic Information Systems Peter van Oosterom TNO Physics and Electronics Laboratory, P.O. Box 96864, 2509 JG The Hague, The Netherlands and DocID: 1qfVZ - View Document
	CISC 829 Computational Geometry HW2 due April 15 WRITTEN EXERCISES: DocID: 1oPZr - View Document
	GEOMETRIC DATA STRUCTURES A Dissertation submitted to the department of COMPUTER SCIENCE of Tufts University in partial fulfillment of the requirements DocID: 1nAkC - View Document
	Shooting Permanent Rays among Disjoint Polygons in the Plane Mashhood Ishaque∗ Bettina Speckmann† Csaba D. T´oth‡ DocID: 1kOUh - View Document
	Lower Bounds For Kinetic Planar Subdivisions Pankaj K. Agarwaly Julien Baschz Mark de Bergx John Hershbergerk DocID: 1gwkM - View Document