Description: 对于给定的初始点集P，有多种三角网剖分方式，其中Delaunay三角网具有以下特征：
1、Delaunay三角网是唯一的；
2、三角网的外边界构成了点集P的凸多边形“外壳”；
3、没有任何点在三角形的外接圆内部，反之，如果一个三角网满足此条件，那么它就是Delaunay三角网。
4、如果将三角网中的每个三角形的最小角进行升序排列，则Delaunay三角网的排列得到的数值最大，从这个意义上讲，Delaunay三角网是“最接近于规则化的“的三角网。-For given initial point set P, a variety of Triangulation, Delaunay triangulation has the following characteristics: 1, Delaunay triangulation is unique 2, the outer boundary of the triangle network constitutes a convex set of points P polygon " shell" 3, did not at any point inside the circumcircle of the triangle, on the contrary, if a triangular network satisfy this condition, then it is the Delaunay triangulation. 4, if the minimum angle of each triangle in the triangulation network in ascending order, Delaunay triangulation arrangement numerical maximum, in this sense, Delaunay triangulation is the closest to the rules of the " triangle net. Platform: |
Size: 112640 |
Author:maxpeach |
Hits:
Description: 该程序是C++源代码，功能是判断一点是否在一个三角形里面-The program is C++ source code, function is to determine whether one point inside a triangle Platform: |
Size: 1846272 |
Author:qqq |
Hits:
Description: Delaunay三角剖分算法 . 一个非常强劲的VC编的Delaunay三角网生成算法，对您学习VC++或GIS的学习都有很好的帮助作用-In mathematics, and computational geometry, a Delaunay triangulation for a set P of points in the plane is a triangulation DT(P) such that no point in P is inside the circumcircle of any triangle in DT(P). Delaunay triangulations maximize the minimum angle of all the angles of the triangles in the triangulation they tend to avoid skinny triangles. The triangulation was invented by Boris Delaunay in 1934 [1].
Based on Delaunay s definition[1], the circumcircle of a triangle formed by three points from the original point set is empty if it does not contain vertices other than the three that define it (other points are permitted only on the very perimeter, not inside).
The Delaunay condition states that a triangle net is a Delaunay triangulation if all the circumcircles of all the triangles in the net are empty. This is the original definition for two-dimensional spaces. It is possible to use it in three-dimensional spaces by using a circumscribed sphere in place of the circumcircl Platform: |
Size: 36864 |
Author:yulin |
Hits:
Description: 提出一种改进的Delaunay三角网渐次插入生成算法。在边界初始化阶段，无须对插入点进行排序，只须按链表顺序插入，在LOP算法中，因交换对角线而产生的新三角形只须遵循Delaunay三角化原则由里向外更新邻接三角形。实验结果表明，改进的算法能提高效率，加快Delaunay三角网的构建速度。-A modified Delaunay triangulation algorithm gradually into generation. Initialization phase of the border, no need to sort the insertion point, simply insert the order by list in the LOP algorithm, generated by exchange of the diagonal triangle only to follow the new principle of Delaunay triangulation update adjacent triangles from the inside out . Experimental results show that the improved algorithm can improve the efficiency, speed up the construction speed of Delaunay triangulation. Platform: |
Size: 191488 |
Author:psl |
Hits:
Description: 判定一个点是否在三角形里，这个函数我在各网站里都没有搜到，所以自己写了一个。函数运行耗费时间比较长，如果点太多的话，就不建议用这个函数了-Determine whether a point is inside the triangle, the function of the website where I have not found, so write one. Function takes a long time to run, and if too many points, it is not recommended to use this function a Platform: |
Size: 1024 |
Author:董萍 |
Hits:
Description: 给定四个点坐标 判定第一个点 是否在后三个点围成的三角形内部外部还是在三角形上-Determine whether the point is inside in the triangle Platform: |
Size: 5120 |
Author:liyang |
Hits:
Description: 传统的近似三角形内点测试( APIT),即近似三角形内点测试定位算法,广泛应用于静态节点定位.结合粒子滤波提出改进算法,将APIT算法推广到节点动态定位.-Traditional approximate point inside the triangle test (APIT), namely the approximate point within the triangle test positioning algorithm, widely used in the static node localization. Combined with particle filter algorithm is proposed to improve the APIT algorithm is extended to the node dynamic positioning. Platform: |
Size: 218112 |
Author:汪鹏 |
Hits:
Description: uva 10112
1. 用三個 for 迴圈跑過任三點的組合
2. 再用一個 for 迴圈跑這三點以外的其他點
3. 如果第四點與選定三點之任兩點所圍三角形面積合，等於選定三點的面積，代表第四點在三角形內
ex : △abc = △abd + △acd + △bcd , d在△內
4. 如果符合條件，把面積存起來，用於之後比較面積大小
5. 面積大的取代面積小的
6. 印出面積最大三角形-Passing any combination of uva 10112 1. Three in three for loop 2 and then a for loop to run other point other than these three points 3. If any of the three points of fourth spot with a selected triangle bounded covering an area equal to three of the area selected, representing the fourth point inside the triangle ex: △ abc = △ abd+ △ acd+ △ bcd, d in △ 4. If eligible, the area to save up for later comparison 5. A large area the size of a small area of 6. replace print the largest triangle Platform: |
Size: 1409024 |
Author:蔡侑侖 |
Hits:
Description: 这个C#程序可以用来判断一个点是否在三角形的内部。-The C# program can be used to determine whether a point inside the triangle. Platform: |
Size: 40960 |
Author:王 |
Hits:
Search - POINT INSIDE TRIANGLE