zhangyiss/delaunay2d
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

update to stable version

Browse Source
This commit is contained in:
张壹
2021-09-19 09:21:11 +08:00
parent b3367003d0
commit 2a69d72aec
10 changed files with 153 additions and 896 deletions
Download Patch File Download Diff File Expand all files Collapse all files

45
demo.cpp
View File

@@ -5,7 +5,7 @@
int main(int argc, char const *argv[])
{
std::vector<vertex2dc> points(7);
std::vector<vertex2dc> points(21);
points[0].set(-0.8, -0.8, 0);
points[1].set(0.4, -1.2, 1);
points[2].set(1.2, -0.9, 2);
@@ -13,7 +13,6 @@ int main(int argc, char const *argv[])
points[4].set(2.5, 0.5, 4);
points[5].set(4.1, 0.7, 5);
points[6].set(5.7, 1.8, 6);
/*
points[7].set(5.1, 3.4, 7);
points[8].set(2.5, 4.4, 8);
points[9].set(1.2, 3.7, 9);
@@ -28,26 +27,14 @@ int main(int argc, char const *argv[])
points[18].set(2.4, 2.8, 18);
points[19].set(3.5, 1.8, 19);
points[20].set(3.6, 3.1, 20);
*/
/*
std::vector<vertex2dc> points(7);
points[0].set(-0.8, -0.8, 0);
points[1].set(0.4, -1.2, 1);
points[2].set(1.2, 0.9, 2);
points[3].set(-0.4, 0.5, 3);
points[4].set(0.2, -0.15, 4);
points[5].set(0.5, 0.375, 5);
points[6].set(0.7, -0.15, 6);
*/
if (duplicated_vertex(points))
{
std::cerr << "Duplicated vertice detected.\n";
std::cerr << "Duplicated vertexes detected.\n";
return 0;
}
std::vector<triangle*> elements;
std::vector<triangle> elements;
triangulation(points, elements);
if (fully_delaunay(elements, points))
@@ -72,36 +59,12 @@ int main(int argc, char const *argv[])
outfile << i + 1 << " 2 0";
for (int j = 0; j < 3; j++)
{
outfile << " " << elements[i]->vert[j]->id + 1;
outfile << " " << elements[i].vert[j]->id + 1;
}
outfile << std::endl;
}
outfile << "$EndElements"<< std::endl;
outfile.close();
// write a neighbor file
outfile.open("demo.neigh");
outfile << elements.size() << std::endl;
for (int i = 0; i < elements.size(); i++)
{
outfile << i + 1;
for (int j = 0; j < 3; j++)
{
if (elements[i]->neigh[j] != nullptr)
{
outfile << " " << elements[i]->neigh[j]->id + 1;
}
else outfile << " -1";
}
outfile << std::endl;
}
outfile.close();
// destroy allocated memories
for (int i = 0; i < elements.size(); i++)
{
delete elements[i];
}
return 0;
}