On the Edge Crossing Properties of Euclidean Minimum Weight Laman Graphs

Computational Geometry(2016)

引用 2|浏览15
暂无评分
摘要
This paper is concerned with the crossing number of Euclidean minimum-weight Laman graphs in the plane. We first investigate the relation between the Euclidean minimum-weight Laman graph and proximity graphs, and then we show that the Euclidean minimum-weight Laman graph is quasi-planar and 6-planar. Thus the crossing number of the Euclidean minimum-weight Laman graph is linear in the number of points.
更多
查看译文
关键词
Delaunay Triangulation,Supporting Line,Sparse Graph,Longe Edge,Interpoint Distance
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要