@inbook {16823,
	title = {Multidimensional data structures for spatial applications},
	booktitle = {Algorithms and theory of computation handbookAlgorithms and theory of computation handbook},
	year = {2010},
	month = {2010///},
	pages = {6 - 6},
	publisher = {Chapman \& Hall/CRC},
	organization = {Chapman \& Hall/CRC},
	abstract = {An overview is presented of a number of representations of multidimensional data that arise in spatial applications. Multidimensional spatial data consists of points as well as objects that have extent such as line segments, rectangles, regions, and volumes. The points may have locational as well as nonlocational attributes. The focus is on spatial data which is a subset of multidimensional data consisting of points with locational attributes and objects with extent. The emphasis is on hierarchical representations based on the "divide-and-conquer" problem-solving paradigm. They are of interest because they enable focusing computational resources on the interesting subsets of data. Thus, there is no need to expend work where the payoff is small. These representations are of use in operations such as range searching and finding nearest neighbors.},
	isbn = {978-1-58488-822-2},
	url = {http://dl.acm.org/citation.cfm?id=1882757.1882763},
	author = {Samet, Hanan},
	editor = {Atallah,Mikhail J. and Blanton,Marina}
}
