success 64772 multidimalgorithm 2008-12-18T13:38:23Z 2009-05-05T23:30:00Z A collection of multi-dimensional data indexing algorithm. It implements the following data structure: Range Tree Priority Search Tree Segment Tree (in progress) Flat Segment Tree This project has just been conceived. There is a lot to be done to bring it to a level of usefulness. Priority Search TreePriority search trees provide optimized look-up speed if you want to query for all x-y points that fall between a certain range along x-axis, with an optional constraint of minimum y value. In other words, if you want to get all data points with in a range of x1 to x2 and of y1 to infinity, this algorithm is known to be efficient. Flat Segment TreeFlat segment tree is a variant of segment tree that is designed to store a collection of non-overlapping segments. This structure is efficient when you need to store values associated with 1 dimensional segments that never overlap with each other. http://code.google.com/p/multidimalgorithm multidimalgorithm 0 0 mit MIT License