Search - delaunay vc

Search - delaunay vc - List

[GDI-Bitmap] VC++Delaunay DL : 0: 一个非常强劲的VC++编的Delaunay三角网生成算法，对您学习VC++或GIS的学习都有很好的帮助作用。-a very strong part of the VC Delaunay Triangulation generation algorithm, right you learn VC or GIS study has very helpful.
Update : 2008-10-13 Size : 197.37kb Publisher : 李未鸣
[Other resource] 2D-Tin-delaunay DL : 2: 在vc++里根据生长算法完成delaunay三角网的构建．其中点是自己随机点上的．-in line with the growth algorithm Delaunay triangulation Construction. Which is their point of random.
Update : 2008-10-13 Size : 83.25kb Publisher : 邓华
[Fractal program] Delaunay DL : 0: 开发的基于VC++生成Delaunay三角网，可用于
Update : 2008-10-13 Size : 20.32kb Publisher : tom
[GDI-Bitmap] delaunay DL : 0: 基于OPENCV的,vc++ 图象处理程序. Delaunay三角形和Voronoi划分的迭代式构造.
Update : 2008-10-13 Size : 3.57kb Publisher : 朱晨
[Other resource] VC++Delaunay DL : 1: 采用序列化对象CArchive读入原始数据构建Delaunay三角网的VC++代码。可以鼠标点击加新点进行构网，包括二维、三维。还可以进行设色、光照等。
Update : 2008-10-13 Size : 146.57kb Publisher : 追风
[Special Effects] delaunay DL : 1: VC和OpenGL实现的点云读取界面，需要的朋友可以下载参考
Update : 2008-10-13 Size : 3.33mb Publisher : 李亮
[Other] delaunay DL : 0: 这是一个关于三角网格的程序的一部分，需要在vc++中应用
Update : 2008-10-13 Size : 1.98kb Publisher : 亚历山大
[Graph Drawing] vc++等值线类库22709_contour_class DL : 2: vc++等值线类库,用于二维要素场分析的关键控件-vc contours class library for 2D element analysis of the key market controls
Update : 2025-02-17 Size : 34kb Publisher : 爱德
[GDI-Bitmap] VC++Delaunay DL : 2: 一个非常强劲的VC++编的Delaunay三角网生成算法，对您学习VC++或GIS的学习都有很好的帮助作用。-a very strong part of the VC Delaunay Triangulation generation algorithm, right you learn VC or GIS study has very helpful.
Update : 2025-02-17 Size : 197kb Publisher : 李未鸣
[GIS program] 2D-Tin-delaunay DL : 0: 在vc++里根据生长算法完成delaunay三角网的构建．其中点是自己随机点上的．-in line with the growth algorithm Delaunay triangulation Construction. Which is their point of random.
Update : 2025-02-17 Size : 83kb Publisher : 邓华
[GDI-Bitmap] delaunay DL : 0: Update : 2025-02-17 Size : 3kb Publisher : 朱晨
[Algorithm] VC++Delaunay DL : 3: 采用序列化对象CArchive读入原始数据构建Delaunay三角网的VC++代码。可以鼠标点击加新点进行构网，包括二维、三维。还可以进行设色、光照等。-Serializing objects using CArchive read the raw data to build Delaunay triangulation VC++ Code. Mouse clicks can add new points structure network, including the two-dimensional, three-dimensional. Can also be used for colors, light and so on.
Update : 2025-02-17 Size : 146kb Publisher : 追风
[.net] delaunay DL : 0: delaunay三角网构建visual studio 2005 c#-delaunay triangulation to build visual studio 2005 c#
Update : 2025-02-17 Size : 40kb Publisher : zhulj
[Special Effects] delaunay DL : 0: VC和OpenGL实现的点云读取界面，需要的朋友可以下载参考-VC and OpenGL realize the point cloud to read interface, the need for a friend can download the reference
Update : 2025-02-17 Size : 3.33mb Publisher : 李亮
[Other] delaunay DL : 0: 这是一个关于三角网格的程序的一部分，需要在vc++中应用-This is a triangular mesh on the part of the procedure, the need for vc++ Application
Update : 2025-02-17 Size : 2kb Publisher : 亚历山大
[GIS program] Delaunay DL : 0: Update : 2025-02-17 Size : 1.95mb Publisher : 徐逍峰
[Windows Develop] Delaunay_triangle_grid DL : 0: 一个简单的读入数据绘制Delaunay三角网的代码-A simple demo of reading data and painting Delaunay triangle grid
Update : 2025-02-17 Size : 147kb Publisher : 徐启龙
[Graph program] Delaunay(Vc) DL : 0: Update : 2025-02-17 Size : 49kb Publisher : zyh
[OpenGL program] Delaunay DL : 0: 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
Update : 2025-02-17 Size : 36kb Publisher : yulin
[GDI-Bitmap] vc-Delaunay-triangulation DL : 0: Achieved with vc Delaunay triangulation of an arbitrary polygon
Update : 2025-02-17 Size : 7.29mb Publisher : 曾宇航

« 12 3 4 »