凸包问题分治法（可视化）

#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <graphics.h>
#include <time.h>
#define MAX 100

int min = 0, max = 0, high, n = 40, UpOrDown, flag, frequency = 0, flag1 = 0, A1, B1;//flag标志，1表示上面还有点，0表示上面没有点;flag1标志，是否分上下凸包,0为不分，1为分 //UpOrDown,0表示下凸包，1表示上凸包
double k, k1, b, d, highest, lowest;

struct{
int x;
int y;
}point[MAX];

void init() {
srand((unsigned)time(NULL));
for (int i = 0; i < n; i++) {
point[i].x = rand() % 1185 + 1;
point[i].y = rand() % 585 + 1;
circle(point[i].x, point[i] .y, 3);
}//将点打印在画板上
}

void jiefangcheng() {
k = (double)(point[min].y - point[max].y) / (double)(point[min].x - point[max].x);
b = (double)point[min].y - k * (double)point[min].x;
}

void findHigh() {
jiefangcheng();
flag = 0;
highest = 0;
lowest = 0;
for (int i = 0; i < n;i++) {
if (!((point[min].y == point[i].y && point[min].x == point[i].x) || (point[max].y == point[i].y && point[max].x == point[i].x))) {
d = fabs((double)(k * (double)point[i].x - (double)point[i].y + b) / sqrt(k * k + 1)) ;
if (UpOrDown == 1) {
if ((k*point[i].x-point[i].y+b) > 0 ) {
flag = 1;
if (d > highest) {
highest = d;
high = i;
}
}
}
else {
if ((k * point[i].x - point[i].y + b) < 0) {
flag = 1;
if (d > lowest) {
lowest = d;
high = i;
}
}
}
}
}
}

void findMinAndMax() {
for (int i = 0; i < n; i++) {
if (point[i].x < point[min].x) min = i;
if (point[i].x > point[max].x) max = i;
}
}

void tuBao() {
frequency++;
setlinecolor(WHITE);
line(point[min].x, point[min].y, point[max].x, point[max].y); //在两点之间画一条线
Sleep(400);
findHigh();
if (flag == 0) {
if(frequency == 1) flag1 = 1;
return;
}
else {
if (!(point[min].x == point[A1].x && point[min].y == point[A1].y && point[max].x == point[B1].x && point[max].y == point[B1].y && flag1 == 1)) {
setlinecolor(BLACK);
line(point[min].x, point[min].y, point[max].x, point[max].y); //清除两点之间的条线
for (int i = 0; i < n; i++) {
setlinecolor(WHITE);
circle(point[i].x, point[i].y, 3);
}//刷新点，防止不清晰
Sleep(400);
}
}

int A = min;
int B = high;
int C = max;
min = A;
max = B;
printf("进入1\n");
tuBao();
min = B;
max = C;
printf("进入2\n");
tuBao();

}

int main() {
initgraph(1200,600,SHOWCONSOLE);//, EW_SHOWCONSOLE
init();
findMinAndMax();
A1 = min;
B1 = max;
UpOrDown = 1;//进入上凸包
tuBao();
UpOrDown = 0;
min = A1;
max = B1;//进入下凸包
tuBao();
while (1);

return 0;

}

视频动态效果链接：https://www.bilibili.com/video/BV1P64y1C7GH?from=search&seid=11376032971057125171