point-to-point segment 点到点分段
To detect the number of intersections to the right from a point that is not aligned with a vertex, start with the formula of the coordinate where the horizontal line intersects a segment (Xi).
要检测未与一个顶点对其的一个点右侧的交点数量,首先使用水平线与一个线段(Xi)相交的坐标公式。
It says if I want to get the length of a segment, going to pass in that instance, it says from that instance, get the start point, that's the thing I just found.
它的意思是如果我想要,得到一个线段的长度,首先要把这个实例传进来,然后对于这个实例,从开始点,取得x坐标,然后通过同样的操作。
If it was, then it became the endpoint for the final segment. Otherwise, the code moved on to the next point.
如果是,它将成为最后一个线段的终点。
It says if I want to get the length of a segment, going to pass in that instance, it says from that instance, get the start point, that's the thing I just found.
它的意思是如果我想要,得到一个线段的长度,首先要把这个实例传进来,然后对于这个实例,从开始点,取得x坐标,然后通过同样的操作。
I'm going to build, this case, a Cartesian point, I'm going to build a second Cartesian point, and my segment passes in those class instances.
我要去建立,在这个例子中,建立一个笛卡尔点,然后再建立一个笛卡尔点,然后向我的segment类。
应用推荐