地图应用聚类算法 [英] Clustering Algorithm for Mapping Application
问题描述
我正在研究地图上的聚类点(纬度/经度).是否有任何关于快速且可扩展的合适算法的建议?
I'm looking into clustering points on a map (latitude/longitude). Are there any recommendations as to a suitable algorithm that is fast and scalable?
更具体地说,我有一系列纬度/经度坐标和一个地图视口.我正在尝试将靠近的点聚集在一起以消除混乱.
More specifically, I have a series of latitude/longitude coordinates and a map viewport. I'm trying to cluster the points that are close together in order to remove clutter.
我已经有了解决问题的方法(见这里),只是我想知道是否有任何正式的算法可以有效地解决问题.
I already have a solution to the problem (see here), only I am wondering if there is any formal algorithm that solves the problem efficiently.
推荐答案
对于虚拟地球应用程序,我使用了所描述的集群此处.它闪电般快速且易于扩展.
For a virtual earth application I've used the clustering described here. It's lightning fast and easily extensible.
这篇关于地图应用聚类算法的文章就介绍到这了,希望我们推荐的答案对大家有所帮助,也希望大家多多支持IT屋!