- 注册时间
- 2007-12-27
- 最后登录
- 1970-1-1
- 威望
- 星
- 金币
- 枚
- 贡献
- 分
- 经验
- 点
- 鲜花
- 朵
- 魅力
- 点
- 上传
- 次
- 下载
- 次
- 积分
- 40149
- 在线时间
- 小时
|
楼主 |
发表于 2023-1-24 13:26:21
|
显示全部楼层
8#得到11棵树最多7个5点圆。
对于12棵树,同样我们可以将一个点反演为无穷远点,然后余下11棵树,最多6行4点共线。
使用配置
//print(ABCJADEKBFGKCHIKDFHJEGIJ);
//solve([+1-1*K_X+1*I_Y*K_X,+1*D_Y-1*E_Y-1*D_Y*K_X,+1*A_Y+1*D_Y-1*E_Y,+1+1*H_Y-1*I_Y,-1+1*I_X,-1+1*E_X],[D_Y,E_Y,I_Y,K_X,A_Y,H_Y,I_X,E_X]);
//print("A_x=0 B_x=0 B_y=0 C_x=0 C_y=1 D=(1,D_y,0) F=(1,0,0) G_x=1 G_y=0 H=(1,H_y,0) J=(0,1,0) K_y=0 ");
//E_X=1,I_X=1,I_Y=s,H_Y=s-1,E_Y=t,D_Y=r,A_Y=t-r,K_X=q
LIB "solve.lib";
ring r0=0,(s,t,r,q,a,b,c,d),dp;
poly pp1=1-q+s*q;
poly pp2=r-t-r*q;
list n1=0,t-r,1;
list n2=0,0,1;
list n3=0,1,1;
list n4=1,r,0;
list n5=1,t,1;
list n6=1,0,0;
list n7=1,0,1;
list n8=1,s-1,0;
list n9=1,s,1;
list n10=0,1,0;
list n11=q,0,1;
list allnodes = n1,n2,n3,n4,n5,n6,n7,n8,n9,n10,n11;
搜索额外添加3个圆的情况,可以找到方程组
si2[1]=2304d8-8768d6+6480d4-1668d2-291
si2[2]=609263c+29664d6+129680d4-524232d2-152807
si2[3]=b-10c2d+10cd+2d3-2d
si2[4]=6a+36b2-128c2-20c+1
si2[5]=4q-36a2+62a-4c-23
si2[6]=r+q-6a-2c+7
si2[7]=t+q-6a+6
si2[8]=s-q-2c+2
解得
d=1.7137118600019076801900383270692606830
c=-0.29128371259364145452198176812175556282
b=-0.19247990049156901986074556429850884674
a=0.45014884487154511629456558338169664745
q=0.30511503475008675243776639224033144510
r=-5.1867893907080989637143364281936626860
t=-3.6042219655208160546703728919501515604
s=-2.2774523904371961566061971440031796805
射影变换阵
[-0.99999999999999999999999999999999999999 -0.15255751737504337621888319612016566442 0]
[0 -0.23674418920460869471713943096332601156 0]
[-1.7165395055834463931886429634663088414 -0.19279749468745641391949632072417377676 0.71653950558344639318864296346630884139]
变换后坐标为
A=(-0.58682109252313931635234790308256703153, -0.91064987257245459884239696440328399741)
B=(0,0)
C=(-0.29128371259364145452198176812175559499, -0.45202444004749461676720778958954576248)
D=(0.29128371259364145452198176812175554191, -1.7137118600019076801900383270692609100)
E=(1.4753414076767881292710106980281042081, -2.7965800100266088286686613853986643430)
F=(0.58256742518728290904396353624351114331, 0)
G=(1,0)
H=(0.46097611503831168910777026123501679576, -0.71535915420768688544970533885365286952)
I=(1.1633847875418099490320878739734857500, -0.96124306320175537743962947899649256928)
J=(0.79128371259364145452198176812175557108, 1.2279422488782552319017820617332316432)
K=(-1.5825674251872829090439635362435137278, 0)
得到图
所以12棵树至少可以9个五点圆。
l5.2 |
|