Packing Plane Spanning Graphs with Short Edges in Complete Geometric Graphs

Computational Geometry(2019)

引用 2|浏览72
暂无评分
摘要
Given a set of points in the plane, we want to establish a connected spanning graph between these points, called connection network, that consists of several disjoint layers. Motivated by sensor networks, our goal is that each layer is connected, spanning, and plane. No edge in this connection network is too long in comparison to the length needed to obtain a spanning tree.
更多
查看译文
关键词
Geometric graphs,Graph packing,Plane graphs,Minimum spanning tree,Bottleneck edge
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要