Unit 3 exercise

[TD-Lemon1900]

link to unit 3 exercise code plz commit here

[MikeLee-lx]

https://github.com/MikeLee-lx/MikeLee/blob/master/xmsj3.m

[add175]

https://github.com/add175/zl

[Maxin-C]

https://github.com/Maxin-C/homework.git This code is operated in Matlab, and it is not perfect. I will submit the code in python if I can deal with the problem of package.

[SHAUNZXY]

https://gitee.com/shaunzxy/ses2020-homework1/tree/master/SES2020spring/unit3
The file name is midterm_project.py. And there are two images in the folder, 10_circles_result.png and 100_circles_result.png.

[byk1001]

https://github.com/byk1001/SES2020spring/tree/master/unit3 I can only do m<=5 in Matlab, I will update my code later

[JinBritain]

https://paste.ubuntu.com/p/ZyTFXNTQHG/

[seenrain]

https://github.com/seenrain/dzf.git

[Ecypack]

code: https://github.com/SESYangLiu/unit3/blob/master/MCircle/main.cpp
class head: https://github.com/SESYangLiu/unit3/tree/master/MCircle/include
class cpp: https://github.com/SESYangLiu/unit3/tree/master/MCircle/src

result: https://github.com/SESYangLiu/unit3/blob/master/result.jpg

[NengzhiWang]

https://github.com/NengzhiWang/Git-Test-SES-Spring/tree/master/unit3

The python code is in file './unit3_main.py'.

There are two methods in this file. Method 2 is better than 1. The compared figures of them are 'Figure_1.png' (for Method 1) and 'Figure_2.png' (for Method 2).
Optimizer from scipy cannot find the global best solution, so the result of Method 2 is still not the best one.

[JackyZhaoG]

https://github.com/JackyZhaoG/MotherBase/tree/master/unit3/CirclePacking

[gylao]

https://github.com/gylao/SES2020spring/tree/master/unit3
code: FindMCircle.py

[Lzcstan]

https://github.com/Lzcstan/Dijkstra_thx/tree/master/SES2020spring/unit3
code:Unit_Three.cpp
referrance:CenterPolygonAlgorithm.pdf
result images:10Circles.png&100Circles.png

[Ouzaixin]

https://github.com/Ouzaixin/ouzaixindezuoye/commits?author=Ouzaixin

[zhouzhenghong-gt]

https://github.com/Zzzzzzzzzzh/2020homework/tree/master/unit3
code: package.py
result: picture in hw3(such as fig_result.png)
method: README.md

[Rapunzel-hair]

https://github.com/Rapunzel-hair/SES2020spring/tree/master/unit3

[KStar-wx]

https://github.com/KStar-wx/homework3/tree/master/unit3

[ORcup]

https://github.com/ORcup/unit3.git

[Jurio0304]

https://github.com/Jurio0304/homework_3/tree/master/unit3
method 1: optimal_r_m.cpp
method 2: MaxCircle.py
The results are plotted on the three images.

[adam99goat]

https://github.com/adam99goat/SES2020spring/tree/master/unit3

[Xinongyang]

https://gitee.com/xinongyang/Sakurajima
the homework is marked with “the third time” including README.txt, three pictures and one .py and one .m files. plz read the README.txt file first

[W-nova]

https://github.com/W-nova/homework.git
code: untitled4
method&result: The third week experiment report
My python was having problems installing the numpy package, and this code is based on matlab. The method is in the word file, but the result of this experiment is not good.

[TD-Lemon1900]

https://github.com/TD-Lemon1900/Miracle/tree/master/unit3
given_r.py provide the solution to unequal circles packing
random_r.py may sovle the problem for the question in the exercise with random r and given m
also there are two pics showing the result

[Maxin-C]

https://github.com/Maxin-C/homework.git The new code in homework3_plus solves the problem about the accuracy of the circle's location. In this new code, the programe can identify the right biggest place to draw the circle.

[MZY996]

https://github.com/MZY996/SES2020spring/tree/master/unit3
The solution uses the greedy algorithm, and the result is relatively good.

[X12345-stu]

https://github.com/X12345-stu/1/blob/master/unit3/Project_exp.py

[liufanxuan]

https://github.com/liufanxuan/123/blob/master/unit3.py

[Billish]

https://gitee.com/Wh_chen/SES2020spring/tree/master/unit3
code ：C++ and python version

[larry444ever]

https://github.com/larry444ever/SES2020spring/tree/master/unit3

The solution is based on the greedy algorithm. The idea of programming refers to the information on baidu and Zhaoyang Meng's code.
test.py provides the code of the solution.
plot(n=18).png is the resulting graph when the number of circles is 18.

[670-jilinliu]

https://github.com/670-jilinliu/SES2020spring/blob/master/unit3/unit3.py

[fank996]

https://github.com/FANG001-A/fang11.git

[Leviosaaaa]

https://github.com/FiniteObliviate/Project-Training-2020/tree/master/unit3/circle_packing_solution

[YunxiAndy]

https://github.com/YunxiAndy/unit3/blob/master/circle.py

[Lupen14461]

https://github.com/Lupen14461/study1