The last chapter described the algorithm in detail with its realization in computer . then it defined three concepts of solution point group 、 same solution group set and different solution group set . it also gave out the algorithm of finding all the solution point sets 第四章从计算机的实现过程来详细描述算法步骤,并定义了最小一乘估计的解点组、同解组集和异解组集的概念,同时给出寻找所有解点组的计算方法,很好地扩展了本文算法的适应性。
The primary idea of the acceleration algorithm focus on the boundary of point set . because only the boundary of a point set is the critical to a convex hull , other point needs not considered . but in classical algorithm , all the point takes part in the calculation 加速算法的思想是这样的,对于一个凸包,算法真正关心的是它的边界上的点,其它的点实际上是不需参与运算的,但是在传统的算法中,所有的点都要参加运算,这就会浪费一些不必要的时间。
Starts from analyzing a special gis applications , the paper points out its widely existence in dss and mis , presents a spatial data model based on constructed point set storage and its developed spatial - temporal model , and proves the validity and practicability of the presented models from theory and actual application 本文从分析一类特殊的gis应用出发,指出了该类应用在mis和dss领域的存在性和广泛性,井针对该类特殊应用提出了基于构造点集的空间数据模型及其时态拓展模型,通过理论分析和实际的应用实践,证明了该模型的有效性和适应性。
The adaptive protective relays categorically sets up the math model and realized theory of adaptive relay protective settings calculation . the calculation of complex faults solves the computation of all kinds of faults involved in power network . the coordination of directional protective relays in multiloop networks solves the calculation of break points set and the coordination of main protection with backup protection 其中自适应定值计算和管理问题分类建立不同元件(线路)自适应继电保护定值计算的数学模型及其实现的理论;复故障计算问题解决了计算电网中各种故障(包括短路、断线)的计算问题;复杂环网的保护配合问题解决了大规模复杂环网断点的求取以及主/后备保护整定配合的问题。
Two algorithms for delaunay triangulation from scattered points are suggested , one of which is from points in plane and the other from points in space . the problem of recognizability of 2d manifold is promoted and the relationship is pointed out between such recognizability and the local structure of a scattered point set 提出并论证了两种计算散乱点集delaunay三角剖分的方法,即平面点集delaunay三角剖分的局部构造算法和空间点集delaunay三角剖分的健壮算法。