Equivalence Of Turn-Regularity And Complete Extensions

PROCEEDINGS OF THE 14TH INTERNATIONAL JOINT CONFERENCE ON COMPUTER VISION, IMAGING AND COMPUTER GRAPHICS THEORY AND APPLICATIONS - VOL 3: IVAPP(2019)

引用 1|浏览2
暂无评分
摘要
The aim of the two-dimensional compaction problem is to minimize the total edge length or the area of an orthogonal grid drawing. The coordinates of the vertices and the length of the edges can be altered while all angles and the shape of the drawing have to be preserved. The problem has been shown to be NP-hard.Two commonly used compaction methods are the turn-regularity approach by (Bridgeman et al., 2000) and the approach by (Klau and Mutzel, 1999) considering complete extensions. We formally prove that these approaches are equivalent, i. e. a face of an orthogonal representation is turn-regular if and only if there exists a unique complete extension for the segments bounding this face.
更多
查看译文
关键词
Graph Drawing, Orthogonal Drawing, Compaction, Turn-Regularity, Complete Extension
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要