伪直线的凸弧绘制
计算几何
2016-01-27 v1
摘要
弱伪线排列是线排列的一种拓扑推广，由拓扑等价于直线的曲线组成，这些曲线彼此最多交叉一次。我们考虑外平面的排列——每个交叉都关联一个无界面——以及简单的排列——每个交叉点仅两条曲线的交叉。我们证明这些排列可由圆的弦、仅有两个弯的凸多边形链或双曲直线表示。简单的但非外平面的排列（非弱）可由凸多边形链或线性复杂度的凸光滑曲线表示。
引用
@article{arxiv.1601.06865,
title = {Convex-Arc Drawings of Pseudolines},
author = {David Eppstein and Mereke van Garderen and Bettina Speckmann and Torsten Ueckerdt},
journal= {arXiv preprint arXiv:1601.06865},
year = {2016}
}
备注
11 pages, 8 figures. A preliminary announcement of these results was made as a poster at the 21st International Symposium on Graph Drawing, Bordeaux, France, September 2013, and published in Lecture Notes in Computer Science 8242, Springer, 2013, pp. 522--523