保持邻接的空间树图
Adjacency-Preserving Spatial Treemaps
摘要：
矩形布局，将外部矩形细分为更小的矩形，在可视化空间信息方面有许多应用，例如在矩形地图中，矩形表示地理或政治区域。空间树图是具有层次结构的矩形布局：外部矩形被细分为矩形，矩形又被细分为更小的矩形。我们描述了用于将不具有这种分层结构的矩形布局与布局的矩形的聚类一起变换成空间树图的算法，该空间树图尊重聚类并且还尽可能地尊重输入布局的邻接。
英文摘要：
Rectangular layouts, subdivisions of an outer rectangle into smaller rectangles, have many applications in visualizing spatial information, for instance in rectangular cartograms in which the rectangles represent geographic or political regions. A spatial treemap is a rectangular layout with a hierarchical structure: the outer rectangle is subdivided into rectangles that are in turn subdivided into smaller rectangles. We describe algorithms for transforming a rectangular layout that does not have this hierarchical structure, together with a clustering of the rectangles of the layout, into a spatial treemap that respects the clustering and also respects to the extent possible the adjacencies of the input layout.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
