arXivDaily arXiv每日学术速递 周一至周五更新
看起来今天可以划水了
arXiv 2008.10583cs.DS
收藏

具有广义端口约束的无向图分层绘制

Layered Drawing of Undirected Graphs with Generalized Port Constraints

Johannes Zink, Julian Walter, Joachim Baumeister, Alexander Wolff

AI总结:

该研究扩展 Sugiyama 框架以支持端口组和无向图边定向,用于自动绘制复杂机器线缆图,并在真实与合成数据上相较 Kieler 减少 10–30% 交叉。

摘要:

本研究的目标是提供一种绘制复杂机器线缆图的实用方法。此类图由电子元件以及连接元件特定端口的线缆组成。由于机器是根据每位客户单独配置的,因此线缆图需要自动绘制。这些图必须具有良好的可读性,以便技术人员能够利用它们调试机器。为了对插座进行建模,我们引入了端口组;在一个组内,端口可以改变其位置(我们利用这一点来改善布局的美观性),但一个组中的端口合在一起必须形成一个连续块。我们通过扩展著名的 Sugiyama 框架来处理绘制此类线缆图的问题,使其纳入端口和端口组。由于该框架假设有向图,我们提出了若干方法来为给定无向图的边定向。我们在真实世界数据以及精心模拟真实世界数据的合成数据上,对这些方法进行了实验比较。我们通过统计弯折数和交叉数来衡量所得图的美观性。利用这些指标,我们在实验中将我们的方法与 Kieler [JVLC 2014] 进行了比较,后者是一个在存在端口约束时绘制图的库。我们的方法产生的交叉数少 10–30%,而在弯折数量以及计算一幅图所用时间方面,其表现与 Kieler 相当或略差。

英文摘要:

The aim of this research is a practical method to draw cable plans of complex machines. Such plans consist of electronic components and cables connecting specific ports of the components. Since the machines are configured for each client individually, cable plans need to be drawn automatically. The drawings must be well readable so that technicians can use them to debug the machines. In order to model plug sockets, we introduce port groups; within a group, ports can change their position (which we use to improve the aesthetics of the layout), but together the ports of a group must form a contiguous block. We approach the problem of drawing such cable plans by extending the well-known Sugiyama framework such that it incorporates ports and port groups. Since the framework assumes directed graphs, we propose several ways to orient the edges of the given undirected graph. We compare these methods experimentally, both on real-world data and synthetic data that carefully simulates real-world data. We measure the aesthetics of the resulting drawings by counting bends and crossings. Using these metrics, we experimentally compare our approach to Kieler [JVLC 2014], a library for drawing graphs in the presence of port constraints. Our method produced 10--30 % fewer crossings, while it performed equally well or slightly worse than Kieler with respect to the number of bends and the time used to compute a drawing.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑