存储用于通过x，y坐标定位的对象-Storingobjectsforlocatingbyx,ycoordinates

14  

Quadtrees seem to solve the specific problem I asked. Kd-Trees are a more general form, for any number of dimensions, rather than just two.

Quadtrees似乎解决了我问的具体问题。 Kd-Trees是一种更通用的形式,适用于任何数量的维度,而不仅仅是两个维度。

R-Trees may also be useful if the objects being stored have a bounding rectangle, rather than being just a simple point.

如果存储的对象具有边界矩形,而不仅仅是一个简单的点,则R树也可能很有用。

The general term for these type of structures is Spatial Index.

这些类型结构的总称是空间索引。

There is a Java implementation of Quadtree and R-Tree.

有一个Quachiree和R-Tree的Java实现。

4  

The general term is a Spatial Index. I guess you should choose according to the existing implementations.

一般术语是空间索引。我想你应该根据现有的实现来选择。

2  

A quadtree is the structure which is usually used for that.

四叉树是通常用于此的结构。

1  

Have a look at Kd-Trees.

看看Kd-Trees。

1  

Simple QuadTree implementation in C# (easy to translate into java) http://www.codeproject.com/KB/recipes/QuadTree.aspx

C#中简单的QuadTree实现(易于翻译成java)http://www.codeproject.com/KB/recipes/QuadTree.aspx

0  

You could put all the x cords in a map, and the y cords in another map, and have the map values point to the object.

您可以将所有x条线放在地图中,将y绳索放在另一个地图中,并使地图值指向该对象。

        TreeMap> xMap = new TreeMap>();
        for (int x = 1; x <100; x += 2)
            for (int y = 0; y <100; y += 2)
                {
                    Point p = new Point(x, y);
                    TreeMap tempx = xMap.get(x);
                    if (tempx == null)
                        {
                            tempx = new TreeMap();
                            xMap.put(x, tempx);
                        }
                    tempx.put(y, p);
                }
        SortedMap> tempq = xMap.subMap(5, 8);
        Collection result = new HashSet();
        for (TreeMap smaller : tempq.values())
            {
                SortedMap smallerYet = smaller.subMap(6, 12);
                result.addAll(smallerYet.values());
            }
        for (Point q : result)
            {
                System.out.println(q);
            }
    }