Quadtree

The connection between the convexity and concavity of vertices of an arbitrary polygon and the quadrant of coordinates is discussed,and an algorithm for detecting the convexity and concavity of vertices of an arbitrary polygon is presented.

文章讨论了多边形顶点凸、凹性与顶点为原点建立的坐标及相邻顶点在此坐标系中所处象限的关系;并根据此思想提出了一种确定任意多边形顶点凸、凹性的判定算法,该算法在一定条件下能够加快判定速度,此时每个顶点的判断需要4次比较。

This article supplements and Proves the general application of interference intensity distribution of polarized light: on:condition:ithat the directions of the transmissive vibration of two polaroids are respectively adjacent to the two quadrants.

本文考虑了两个偏振片透振方向分别在相邻两个象限的情况，补充证明了偏振光干涉强度分布公式的普遍适用性。

Also the end point distinction and the automatic quadrant problem are solved.

该算法对一般的逐点比较法进行了改进,在插补过程中只进行整数的加、减法运算,减少了数据的处理时间,解决了终点判别问题和自动过象限问题。