Quadrangulations on 3-colored point sets with Steiner points and their winding number
Quadrangulations on 3-colored point sets with Steiner points and their winding number
复制标题
具有 Steiner 点及其绕数的 3 色点集上的四边形
DOI:
10.1007/s00373-013-1346-4
复制
发表时间:
2014
影响因子:
0.7
通讯作者:
Atsuhiro Nakamoto
中科院分区:
文献类型:
--
作者:
Sho Kato;Ryuich Mori; Atsuhiro Nakamoto
LetPbe a point set on the plane, and consider whetherPisquadrangulatable, that is, whether there exists a 2-connected plane graphGwith each edge a straight segment such thatV(G) =P, that the outer cycle ofGcoincides with the convex hull Conv(P) ofP, and that each finite face ofGis quadrilateral. It is easy to see that it is possible if and only if an even number of points ofPlie on Conv(P). Hence we give ak-coloring toP, and consider the same problem, avoiding edges joining two vertices ofPwith the same color. In this case, we always assume that the number of points ofPlying on Conv(P) is even and that any two consecutive points on Conv(P) have distinct colors. However, for everyk≥ 2, there is ak-colored non-quadrangulatable point setP. So we introduceSteiner points, which can be put in any position of the interior of Conv(P) and each of which may be colored by any of thekcolors. Whenk= 2, Alvarez et al. proved that if a point setPon the plane consists ofred andblue points in general position, then adding Steiner pointsQwith,P∪Qis quadrangulatable, but there exists a non-quadrangulatable 3-colored point set for which no matter how many Steiner points are added. In this paper, we define thewinding numberfor a 3-colored point setP, and prove that a 3-colored point setPin general position with a finite setQof Steiner points added is quadrangulatable if and only if the winding number ofPis zero. WhenP∪Qis quadrangulatable, we prove, where |P| =nand the number of points ofPin Conv(P) is 2m.