提出一种根据多边形各个极点在顶点序列中的先后顺序确定多边形方向的算法。
An algorithm for identifying the orientation of a polygon according to the sequence of extremity vertexes is proposed.
列表定义多边形，并可以相互层叠，来表示方向完全相反但描述相同地理区域的数据集，从而形成数据详细的地图。
The lists define polygons and can be layered on top of each other to map data sets of completely different origins while describing the same geographical area to form extremely data-rich maps.
通过察看目标网格上的一个面，比如窗户那里的面，你将可以看到在你源网格的每一个多边形或多或少的指向你的方向。
By looking through a face on the target mesh, as if it where a window, you should be able to see every polygon on your source mesh pointing more or less in your direction.
应用推荐