一种带障碍的空间聚类算法
Algorithm for Spatial Clustering with Obstacles
摘要：
在本文中，我们提出了一种有效的聚类技术，以解决存在障碍物的聚类问题。该算法将空间区域划分为矩形单元。每个细胞都与统计信息相关联，使我们能够将细胞标记为密集或非密集。我们还将每个单元格标记为有障碍（即与任何障碍物相交）或无障碍。然后，该算法找到连接的，密集的，无障碍的细胞的区域（集群）。最后，该算法为每个这样的区域找到一个中心，并将这些中心作为空间区域中相对密集的区域（聚类）的中心返回。
英文摘要：
In this paper, we propose an efficient clustering technique to solve the problem of clustering in the presence of obstacles. The proposed algorithm divides the spatial area into rectangular cells. Each cell is associated with statistical information that enables us to label the cell as dense or non-dense. We also label each cell as obstructed (i.e. intersects any obstacle) or non-obstructed. Then the algorithm finds the regions (clusters) of connected, dense, non-obstructed cells. Finally, the algorithm finds a center for each such region and returns those centers as centers of the relatively dense regions (clusters) in the spatial area.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
