论文标题
相等的面积断裂：数据的分类方案，以获得颜色均匀的绒毛图
Equal Area Breaks: A Classification Scheme for Data to Obtain an Evenly-colored Choropleth Map
论文作者
论文摘要
引入了用于计算合并地图分类方案的有效算法，称为相等的区域断裂或地理位置。相等的区域断裂分类旨在获得地图的着色，以使与每种颜色相关的区域大致相等。这本来可以替代一种方法，该方法将具有特定属性范围的属性范围的区域分配给每个颜色，称为分位数，这可能导致映射区域以一种或几种颜色为主。此外，其他颜色可能几乎无法辨别。当某些地区比其他地区大得多（例如，将瑞士与俄罗斯进行比较）时，就是这种情况。提出了许多不同计算复杂性的算法，以实现与区域的同等区域分配。它们包括一对贪婪算法，以及基于动态编程的最佳算法。比较从最佳相等区域算法获得的分类与分位数和詹克斯自然断裂算法进行了比较，并且通过用户研究从视觉角度发现了优越。最后，提出了一种修改的方法，该方法使用户能够改变着色算法满足每种颜色相同面积的相互矛盾目标的程度，并将相等数量的区域分配给每种颜色。
An efficient algorithm for computing the choropleth map classification scheme known as equal area breaks or geographical quantiles is introduced. An equal area breaks classification aims to obtain a coloring for the map such that the area associated with each of the colors is approximately equal. This is meant to be an alternative to an approach that assigns an equal number of regions with a particular range of property values to each color, called quantiles, which could result in the mapped area being dominated by one or a few colors. Moreover, it is possible that the other colors are barely discernible. This is the case when some regions are much larger than others (e.g., compare Switzerland with Russia). A number of algorithms of varying computational complexity are presented to achieve an equal area assignment to regions. They include a pair of greedy algorithms, as well as an optimal algorithm that is based on dynamic programming. The classification obtained from the optimal equal area algorithm is compared with the quantiles and Jenks natural breaks algorithms and found to be superior from a visual standpoint by a user study. Finally, a modified approach is presented which enables users to vary the extent to which the coloring algorithm satisfies the conflicting goals of equal area for each color with that of assigning an equal number of regions to each color.
