songsenand
/
cgal
mirror of https://github.com/CGAL/cgal
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

simplest example

This commit is contained in:
Pierre Alliez 2017-11-14 18:31:52 +01:00
parent 7f515a63d4
commit 1e4e6329ba
2 changed files with 27 additions and 26 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

12
Surface_mesh_approximation/examples/Surface_mesh_approximation/vsa_approximation_example.cpp
View File

@ -22,20 +22,20 @@ int main()
// output polyhedral surface and indexed triangle mesh
Polyhedron output;
std::vector<std::size_t> triangles;
std::vector<Kernel::Point_3> points;
std::vector<std::vector< std::size_t> > triangles; // contains triplets of indices
std::vector< Kernel::Point_3 > points;
// free function interface with named parameters
bool valid_polyhedron = CGAL::VSA::mesh_approximation(input,
std::back_inserter(points),
std::back_inserter(triangles),
CGAL::VSA::parameters::init_method(CGAL::VSA::Hierarchical). // hierarchical init
refine_until_proxies(200). // refine until target number of proxies
iterations(30). // number of relaxation iterations after seeding
anchor_points(std::back_inserter(points)). // get anchor points
indexed_triangles(std::back_inserter(triangles)). // get indexed triangles
output); // output to polyhedron, if 2-manifold and oriented
output_mesh(output)); // output to polyhedron, if 2-manifold and oriented
std::cout << "#anchor points: " << points.size() << std::endl;
std::cout << "#triangles: " << triangles.size() / 3 << std::endl;
std::cout << "#triangles: " << triangles.size() << std::endl;
if (valid_polyhedron)
std::cout << "oriented 2-manifold output." << std::endl;

41
Surface_mesh_approximation/examples/Surface_mesh_approximation/vsa_simple_approximation_example.cpp
View File

@ -12,28 +12,29 @@ typedef CGAL::Polyhedron_3<Kernel> Polyhedron;
int main()
{
// create polyhedral surface and read input surface triangle mesh
Polyhedron input;
std::ifstream file("data/mask.off");
if (!file || !(file >> input) || input.empty()) {
std::cerr << "Invalid off file." << std::endl;
return EXIT_FAILURE;
}
// create polyhedral surface and read input surface triangle mesh
Polyhedron input;
std::ifstream file("data/mask.off");
if (!file || !(file >> input) || input.empty()) {
std::cerr << "Invalid off file." << std::endl;
return EXIT_FAILURE;
}
// output polyhedral surface and indexed triangle mesh
std::vector<std::size_t> triangles;
std::vector<Kernel::Point_3> points;
// output polyhedral surface and indexed triangle mesh
Polyhedron output;
std::vector<std::vector< std::size_t> > triangles; // contains triplets of indices
std::vector< Kernel::Point_3 > points;
// free function interface with named parameters
bool valid_polyhedron = CGAL::VSA::mesh_approximation(input,
CGAL::VSA::parameters::init_method(CGAL::VSA::Hierarchical). // hierarchical init
refine_until_proxies(200). // refine until target number of proxies
iterations(30). // number of relaxation iterations after seeding
anchor_points(std::back_inserter(points)). // get anchor points
indexed_triangles(std::back_inserter(triangles))); // get indexed triangles
// free function interface with named parameters
bool valid_polyhedron = CGAL::VSA::mesh_approximation(input,
std::back_inserter(points),
std::back_inserter(triangles),
CGAL::VSA::parameters::init_method(CGAL::VSA::Hierarchical). // hierarchical init
refine_until_proxies(200). // refine until target number of proxies
iterations(30));
std::cout << "#anchor points: " << points.size() << std::endl;
std::cout << "#triangles: " << triangles.size() / 3 << std::endl;
std::cout << "#anchor points: " << points.size() << std::endl;
std::cout << "#triangles: " << triangles.size() << std::endl;
return EXIT_SUCCESS;
return EXIT_SUCCESS;
}