Location:
Search - deluanay
Search list
Description: void CDelaunayView::OnDelaunay()
{
// TODO: Add your command handler code here
CDelaunayDoc* pDoc = GetDocument();
ASSERT_VALID(pDoc);
if(!pDoc->PointList->GetCount())
{
char str[100];
ostrstream osr(str,100);
osr<<"请用鼠标左键在窗口里选择要进行三角剖分的顶点"<<'\n'
<<" 谢谢合作"TriList);
pos4 = pDoc->TriList->GetHeadPosition();
TriAngle* pTriSeed = (TriAngle*)pDoc->TriList->GetAt(pos4);
pos5 = pDoc->PointList->GetHeadPosition();
while(pos5 != NULL)
{
PointCls* pa = (PointCls*)pDoc->PointList->GetNext(pos5);
if(pa->index == pTriSeed->index[0])
{
p1 = pa;
}
if(pa->index == pTriSeed->index[1])
{
p2 = pa;
Platform: |
Size: 55489 |
Author: 798310473@qq.com |
Hits:
Description: 开发deluanay三角网的vb程序代码-Development deluanay triangular net vb code
Platform: |
Size: 9216 |
Author: 帅草蜢 |
Hits:
Description: 基于opencv的Deluanay抛分算法，可以实现点到面的扩散-Opencv of Deluanay throw points based algorithms, can point to the proliferation of surface
Platform: |
Size: 1368064 |
Author: lw3171796 |
Hits:
Description: 人机交互逐点插入生成Deluanay三角网-HCI insertion point by point triangulation to generate Delaunay TIN
Platform: |
Size: 4096 |
Author: 文磊 |
Hits:
Description: 该函数计算根据有限组点生成一个任意多面体界Voronoi图。能够在三角测量任何两个连接点之间形成线性Voronoi图。-The function calculates Voronoi diagram with the finite set of points that are bounded by an arbitrary polytope. The Voronoi diagram is obtained using linear ineqaulities formed with persendicular bisecters between any two connected points in the Deluanay triangulation.
Here are the description of the uploads.
Platform: |
Size: 12288 |
Author: 1390481 |
Hits: