arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2109.05689cs.CG
收藏

广义扫描线生成器

Generalized Sweeping Line Spanners

Keenan Lee, André van Renssen

AI总结:

本文提出了$Θ$-图的推广——扫描线图,证明其在完全图、线段约束及多边形障碍环境下的可见图中均为生成器,并通过一般归纳论证统一了受限环境的证明。

摘要:

我们提出了扫描线图,它是$Θ$-图的推广。我们证明这些图是完全图的生成器,并且在考虑线段约束或多边形障碍物时,也是可见图的生成器。我们的证明使用一般的归纳论证来实现向受限环境的过渡。这些论证同样适用于无约束环境下的其他生成器构造,从而无需为受限和多边形障碍环境分别寻找它们是生成器的证明。

英文摘要:

We present sweeping line graphs, a generalization of $Θ$-graphs. We show that these graphs are spanners of the complete graph, as well as of the visibility graph when line segment constraints or polygonal obstacles are considered. Our proofs use general inductive arguments to make the step to the constrained setting. These same arguments could apply to other spanner constructions in the unconstrained setting, removing the need to find separate proofs that they are spanning in the constrained and polygonal obstacle settings.

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

↑