Stable Voronoi-based visualizations for software quality monitoring
Stable Voronoi-based visualizations for software quality monitoring
复制标题
用于软件质量监控的基于 Voronoi 的稳定可视化
DOI：
10.1109/vissoft.2015.7332410
复制
发表时间：
2015
期刊：
影响因子：
--
通讯作者：
Jurriaan Hage
中科院分区：
文献类型：
--
作者：
Rinse van Hees;Jurriaan Hage
Voronoi树图可以用来有效地可视化给定软件系统的软件质量属性。为了方便地跟踪随着软件从一个版本到下一个版本的演进，这些属性的值是如何随时间变化的，生成的可视化必须是稳定的，因为属性值的微小变化会导致可视化中的微小变化。由于计算Voronoi树图的标准算法的不确定性，稳定性不能得到保证。本文引入了可加加权幂Voronoi图的稳定Voronoi树图。我们使用缩放的希尔伯特曲线将Voronoi站点放置在平面上，从而获得可预测的站点最终位置的第一个良好近似值，然后保留站点沿该曲线放置的顺序，以便与同一软件系统的修订进行比较。我们表明，我们的算法不仅提供了更多的稳定性，而且由于更好的位置，它需要更少的迭代来计算结果。
Voronoi treemaps can be used to effectively visualize software quality attributes of a given software system. To easily keep track of how the values of such attributes change over time as the software evolves from one version to the next, it is essential that the produced visualizations are stable in the sense that small changes to the values of the attributes lead to small changes in the visualization. Due to the non-deterministic nature of the standard algorithm for computing Voronoi treemaps, stability is not guaranteed. In this paper we introduce stable Voronoi treemaps for additively weighted power Voronoi diagrams. We employ scaled Hilbert curves to place Voronoi sites in the plane, thereby achieving a predictable first good approximation of the final location of the sites, and then retain the order in which sites are placed along that curve for easy comparison with revisions of the same software system. We show that our algorithm not only provides more stability, but also that because of better placement it needs fewer iterations to compute its result.