提出了曲线局部特征点的概念，并根据平行线原理给出了一种快速求取特征点的算法。通过对局部特征点进行优化，得到所需的局部特征点集，实现了曲线的离散。该方法在离散过程中充分考虑了离散精度误差与逼近弦长对后续三角化质量的影响。实验结果表明，由这些特征点组成的多边形可较好地逼近曲线，算法效率较高。

The curve discretization is one of the fundamental issues in triangulation of planar region and the parameter domain of curved surface. In this paper, the conception of the curve's local feature point is presented. A fast algorithm for the acquisition of the curve's local feature point is proposed, according to the theory of parallel. Through optimizing the local feature point, the needless local feature point is omitted, and the feature point set requisite is obtained. Accordingly the curve discretization is realized, making use of the curve's local feature point. In the course of curve discretization, the quality influence of the succeeding triangulation, resulted by the tolerance of the discretization precision and the length of the approximation polygon edge, is fully considered in this method. If the approximation precision is high, the curve surface crack can be avoided. If the edge of the approximation polygon is too short, too dense triangle mesh will be created, which will result in long computation time and more memory space, or the long and narrow triangle mesh will be produced, which will make the quality of triangle mesh worse. Experiments indicate that the polygon consisting of the feature points can perfectly approximate the curve, and the algorithm is highly efficient.