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

do not duplicate point creation that blur the examples

This commit is contained in:
Jane Tournois 2020-09-28 18:14:56 +02:00
parent 57250ce637
commit f7806b63ea
2 changed files with 4 additions and 16 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

10
Triangulation_3/examples/Triangulation_3/segment_cell_traverser_3.cpp
View File

@ -89,16 +89,10 @@ int main(int argc, char* argv[])
////////////////////////////////////////////////////////////
// Construct a traverser and use range-iterator
////////////////////////////////////////////////////////////
Point_3 p3(rng.get_double(xmin, xmax),
rng.get_double(ymin, ymax),
rng.get_double(zmin, zmax));
Point_3 p4(rng.get_double(xmin, xmax),
rng.get_double(ymin, ymax),
rng.get_double(zmin, zmax));
// Count the number of finite cells traversed.
inf = 0, fin = 0;
for (const Cell_handle ch : dt.segment_traverser_cell_handles(p3, p4))
for (const Cell_handle ch : dt.segment_traverser_cell_handles(p1, p2))
{
if (dt.is_infinite(ch))
++inf;
@ -106,7 +100,7 @@ int main(int argc, char* argv[])
++fin;
}
std::cout << "While traversing from " << p3 << " to " << p4 << std::endl;
std::cout << "While traversing from " << p1 << " to " << p2 << std::endl;
std::cout << inf << " infinite and "
<< fin << " finite cells were visited." << std::endl;
std::cout << std::endl << std::endl;

10
Triangulation_3/examples/Triangulation_3/segment_simplex_traverser_3.cpp
View File

@ -75,15 +75,9 @@ int main(int argc, char* argv[])
////////////////////////////////////////////////////////////
// Construct a traverser and use range-iterator
////////////////////////////////////////////////////////////
Point_3 p3(rng.get_double(-0.48, 0.31),
rng.get_double(-0.22, 0.22),
rng.get_double(-0.19, 0.19));
Point_3 p4(rng.get_double(-0.48, 0.31),
rng.get_double(-0.22, 0.22),
rng.get_double(-0.19, 0.19));
nb_cells = 0, nb_facets = 0, nb_edges = 0, nb_vertex = 0;
for (const Simplex& s : dt.segment_traverser_simplices(p3, p4))
for (const Simplex& s : dt.segment_traverser_simplices(p1, p2))
{
if (s.dimension() == 3) ++nb_cells;
else if (s.dimension() == 2) ++nb_facets;
@ -92,7 +86,7 @@ int main(int argc, char* argv[])
}
#ifdef CGAL_TRIANGULATION_3_VERBOSE_TRAVERSER_EXAMPLE
std::cout << "While traversing from " << p3 << " to " << p4 << std::endl;
std::cout << "While traversing from " << p1 << " to " << p2 << std::endl;
std::cout << "\tcells : " << nb_cells << std::endl;
std::cout << "\tfacets : " << nb_facets << std::endl;
std::cout << "\tedges : " << nb_edges << std::endl;