Based on the idea of constrained triangulation, a practical criterion and corresponding algorithm to determine the point inclusion of polygon are put forward.
基于受约束的三角划分的思想，提出了一种新的判断点在多边形内外的准则，并给出了算法。
The paper presents a new triangulation method suitable for both multiple connected polygonal domains and unconnected constrained data.
本文提出了一种适用于多连通的多边形区域的三角剖分和非连通的受限数据的三角剖分算法。
The triangulation of constrained data set is widely used in Geographic Information System (GIS), geo-science, computational geometry, multi-resolution and high precision DTM, et al.
顾及地形特征线的散点域(约束数据域)三角剖分是建立高精度数字地面模型的基础，在GIS、地学分析、计算几何、多分辨率DTM等领域中有着广泛的应用。
The triangulation of constrained data set is widely used in Geographic Information System (GIS), geo-science, computational geometry, multi-resolution and high precision DTM, et al.
顾及地形特征线的散点域(约束数据域)三角剖分是建立高精度数字地面模型的基础，在GIS、地学分析、计算几何、多分辨率DTM等领域中有着广泛的应用。
应用推荐