刚学习这门课程，不明白 数据结构

#include <stdio.h>
#include <stdbool.h>

#define MAX_HEIGHT 100 // 定义最大阻挡高度

// 定义二维点结构
typedef struct Point {
    int x;
    int y;
} Point;

// 计算两点之间的距离
double distance(Point p1, Point p2) {
    return sqrt(pow(p1.x - p2.x, 2) + pow(p1.y - p2.y, 2));
}

// 判断两个采样点之间是否有可见的障碍物
bool isObstacleBetween(Point source, Point destination, int obstacles[][2], int numObstacles) {
    int i;
    for (i = 0; i < numObstacles; i++) {
        Point obstacle = {obstacles[i][0], obstacles[i][1]};
        double distanceSourceToObstacle = distance(source, obstacle);
        double distanceObstacleToDestination = distance(obstacle, destination);
        double totalDistance = distance(source, destination);

        // 使用线性加权估计计算两个采样点之间的障碍物高度估计值
        double estimatedHeight = (distanceSourceToObstacle * obstacles[i][2] + distanceObstacleToDestination * MAX_HEIGHT) / totalDistance;

        if (estimatedHeight > obstacles[i][2]) {
            return true;
        }
    }

    return false;
}

// 检查是否可见光源的采样点
void checkVisiblePoints(Point lightSource, Point samplingPoints[], int numSamplingPoints, int obstacles[][2], int numObstacles) {
    int i;
    for(i = 0; i < numSamplingPoints; i++) {
        if (!isObstacleBetween(lightSource, samplingPoints[i], obstacles, numObstacles)) {
            printf("(%d,%d) is visible\n", samplingPoints[i].x, samplingPoints[i].y);
        } else {
            printf("(%d,%d) is not visible\n", samplingPoints[i].x, samplingPoints[i].y);
        }
    }
}

int main() {
    // 定义示例数据
    Point lightSource = {0, 0};
    Point samplingPoints[] = {{1, 3}, {2, 0}, {3, 3}};
    int obstacles[][3] = {{1, 0, 18}, {0, 2, 8}, {1, 2, 5}};

    // 计算采样点是否可见
    checkVisiblePoints(lightSource, samplingPoints, sizeof(samplingPoints) / sizeof(samplingPoints[0]), obstacles, sizeof(obstacles) / sizeof(obstacles[0]));

    return 0;
}