搜索结果: 1-1 共查到“拓扑学 rectilinear crossing number”相关记录1条 . 查询时间(0.078 秒)
Point sets that minimize $(\le k)$-edges, $3$-decomposable drawings, and the rectilinear crossing number of $K_{30}$
k–edges 3-decomposability rectilinear crossing number
2010/12/10
There are two properties shared by all known crossing-minimizing geometric drawings of Kn, for n a multiple of 3.First, the underlying n-point set of these drawings has exactly 3k+2
2(≤ k)...