最近在研究Delauany這個方法，是一般2d轉3d的方法，
想找一個bcb的範例程式，請問有大大用過嗎？

你可以查詢Delaunay或是Vornoni。
http://www.csit.fsu.edu/~burkardt/cpp_src/cpp_src.html
上面的網頁有範例，但是他似乎是一個project，我不怎麼會改....
我之前是用一個O(n^4)的方法寫出來的，在一本計算幾何的課本中有寫....
如果node數目太多不會太慢.....

請問是哪一本計算機圖學的書啊？

不是計算機圖學喔，是計算幾何...
Computational Geometry in C 2nd

===================引 用 文 章===================
請問是哪一本計算機圖學的書啊？

謝謝~~我會找找看這本書看看，關於delaunay三角化我已經在網路上看了很多的範例了，
還在研究程式的內容中…

請問你那時候也是用BCB寫的嗎？
還有留下那個範例程式，可以借我參考一下嗎？
我試寫了，但是bug很多，唉~

以下是我的source code，因為是我的project，所以我沒辦法公佈所有的code，這是主要做三角化的部份，我是照書上的內容抄的，只做了一些改變

int i,j,k,m;
double xn,yn,zn;
int flag;
triangle_no=0;
//透過Delaunay Triangulation，求出三角形個數
int i_count=0;
dx[0]=point[vertex].coordinate_x;
dy[0]=point[vertex].coordinate_y;
dz[0]=dx[0]*dx[0] dy[0]*dy[0];
for(i=0;i {
dx[i_count 1]=point[vertex].Neighbor[i_count].coordinate_x;
dy[i_count 1]=point[vertex].Neighbor[i_count].coordinate_y;
dz[i_count 1]=dx[i_count 1]*dx[i_count 1] dy[i_count 1]*dy[i_count 1];
i_count ;
}
for (i = 0; i for (j = i 1; j < neighbor_number; j )
for (k = i 1; k < neighbor_number; k )
{
if(j!=k)
{
xn=(dy[j]-dy[i])*(dz[k]-dz[i]) - (dy[k]-dy[i])*(dz[j]-dz[i]);
yn=(dx[k]-dx[i])*(dz[j]-dz[i]) - (dx[j]-dx[i])*(dz[k]-dz[i]);
zn=(dx[j]-dx[i])*(dy[k]-dy[i]) - (dx[k]-dx[i])*(dy[j]-dy[i]);
if(flag =(zn<0))
for (m = 0; m < neighbor_number; m )
flag=flag&&
( (dx[m]-dx[i])*xn
(dy[m]-dy[i])*yn
(dz[m]-dz[i])*zn <=0);
if(flag)
{
triangle_no ;
}
}
}
int counter=0;//目前三角形
//求出Delaunay Triangulation
int find_vertex=0;
for (i = 0; i for (j = i 1; j < neighbor_number; j )
for (k = i 1; k < neighbor_number; k )
{
if(j!=k)
{
xn=(dy[j]-dy[i])*(dz[k]-dz[i]) - (dy[k]-dy[i])*(dz[j]-dz[i]);
yn=(dx[k]-dx[i])*(dz[j]-dz[i]) - (dx[j]-dx[i])*(dz[k]-dz[i]);
zn=(dx[j]-dx[i])*(dy[k]-dy[i]) - (dx[k]-dx[i])*(dy[j]-dy[i]);
if(flag =(zn<0))
for (m = 0; m < neighbor_number; m )
flag=flag&&
( (dx[m]-dx[i])*xn
(dy[m]-dy[i])*yn
(dz[m]-dz[i])*zn <=0);
if(flag)
{
AnsiString voronoi_center="v" IntToStr(vertex);
if(i==0)
{
StringGrid1->Cells[0][counter]=voronoi_center;
StringGrid1->Cells[1][counter]=point[point[vertex].Neighbor[j].vertex_ID.SubString(2,point[vertex].Neighbor[j].vertex_ID.Length()-1).ToInt()].vertex_ID;
StringGrid1->Cells[2][counter]=point[point[vertex].Neighbor[k].vertex_ID.SubString(2,point[vertex].Neighbor[k].vertex_ID.Length()-1).ToInt()].vertex_ID;
V_Memo->Lines->Add("v" IntToStr(vertex) " "
StringGrid1->Cells[0][counter] " "
StringGrid1->Cells[1][counter] " "
StringGrid1->Cells[2][counter]);

}
if(j==0)
{
StringGrid1->Cells[0][counter]=point[point[vertex].Neighbor[i].vertex_ID.SubString(2,point[vertex].Neighbor[i].vertex_ID.Length()-1).ToInt()].vertex_ID;
StringGrid1->Cells[1][counter]=voronoi_center;
StringGrid1->Cells[2][counter]=point[point[vertex].Neighbor[k].vertex_ID.SubString(2,point[vertex].Neighbor[k].vertex_ID.Length()-1).ToInt()].vertex_ID;
V_Memo->Lines->Add("v" IntToStr(vertex) " "
StringGrid1->Cells[0][counter] " "
StringGrid1->Cells[1][counter] " "
StringGrid1->Cells[2][counter]);
}
if(k==0)
{
StringGrid1->Cells[0][counter]=point[point[vertex].Neighbor[i].vertex_ID.SubString(2,point[vertex].Neighbor[i].vertex_ID.Length()-1).ToInt()].vertex_ID;
StringGrid1->Cells[1][counter]=point[point[vertex].Neighbor[j].vertex_ID.SubString(2,point[vertex].Neighbor[j].vertex_ID.Length()-1).ToInt()].vertex_ID;
StringGrid1->Cells[2][counter]=voronoi_center;
V_Memo->Lines->Add("v" IntToStr(vertex) " "
StringGrid1->Cells[0][counter] " "
StringGrid1->Cells[1][counter] " "
StringGrid1->Cells[2][counter]);
}
if( (StringGrid1->Cells[0][counter]==voronoi_center))
{
StringGrid2->Cells[0][find_vertex]=StringGrid1->Cells[1][counter];
find_vertex ;
StringGrid2->Cells[0][find_vertex]=StringGrid1->Cells[2][counter];
find_vertex ;
}
if( (StringGrid1->Cells[1][counter]==voronoi_center))
{
StringGrid2->Cells[0][find_vertex]=StringGrid1->Cells[0][counter];
find_vertex ;
StringGrid2->Cells[0][find_vertex]=StringGrid1->Cells[2][counter];
find_vertex ;
}
if( (StringGrid1->Cells[2][counter]==voronoi_center))
{
StringGrid2->Cells[0][find_vertex]=StringGrid1->Cells[0][counter];
find_vertex ;
StringGrid2->Cells[0][find_vertex]=StringGrid1->Cells[1][counter];
find_vertex ;
}
counter ;
}

}
}

謝謝~~我研究一下，有問題再問你嚕~謝謝

請問一下你有試過轉為3d的嗎？