mirror of https://github.com/CGAL/cgal
more verbose is_valid
This commit is contained in:
parent
cf73165563
commit
fc0cb34e64
|
|
@ -1956,16 +1956,22 @@ public:
|
||||||
switch(this->dimension()) {
|
switch(this->dimension()) {
|
||||||
case 3: {
|
case 3: {
|
||||||
for(auto it = this->finite_cells_begin(), end = this->finite_cells_end(); it != end; ++it) {
|
for(auto it = this->finite_cells_begin(), end = this->finite_cells_end(); it != end; ++it) {
|
||||||
this->is_valid_finite(it);
|
this->is_valid_finite(it, verbose, level);
|
||||||
for(int i = 0; i < 4; i++) {
|
for(int i = 0; i < 4; i++) {
|
||||||
const auto n = it->neighbor(i);
|
const auto n = it->neighbor(i);
|
||||||
const auto n_index = n->index(it);
|
const auto n_index = n->index(it);
|
||||||
if(!this->is_infinite(n->vertex(n_index)))
|
if(!this->is_infinite(n->vertex(n_index)))
|
||||||
{
|
{
|
||||||
if(!it->is_facet_constrained(i) && this->side_of_sphere(it, n->vertex(n_index)->point()) == ON_BOUNDED_SIDE) {
|
if(!it->is_facet_constrained(i) && this->side_of_sphere(it, n->vertex(n_index)->point()) == ON_BOUNDED_SIDE) {
|
||||||
if(verbose)
|
if(verbose) {
|
||||||
std::cerr << "non-empty sphere " << std::endl;
|
std::cerr << "non-empty sphere at non-constrainted facet (" << IO::oformat(Cell_handle(it))
|
||||||
|
<< ", " << i << ") the cell is:\n "
|
||||||
|
<< IO::oformat(it->vertex(0), with_point) << "\n "
|
||||||
|
<< IO::oformat(it->vertex(1), with_point) << "\n "
|
||||||
|
<< IO::oformat(it->vertex(2), with_point) << "\n "
|
||||||
|
<< IO::oformat(it->vertex(3), with_point) << "\ncontains:\n "
|
||||||
|
<< IO::oformat(n->vertex(n_index), with_point_and_info) << '\n';
|
||||||
|
}
|
||||||
CGAL_assertion(false);
|
CGAL_assertion(false);
|
||||||
return false;
|
return false;
|
||||||
}
|
}
|
||||||
|
|
@ -1977,7 +1983,7 @@ public:
|
||||||
case 2: {
|
case 2: {
|
||||||
for(auto it = this->finite_facets_begin(), end = this->finite_facets_end(); it != end; ++it) {
|
for(auto it = this->finite_facets_begin(), end = this->finite_facets_end(); it != end; ++it) {
|
||||||
const auto c = it->first;
|
const auto c = it->first;
|
||||||
this->is_valid_finite(c);
|
this->is_valid_finite(c, verbose, level);
|
||||||
for(int i = 0; i < 3; i++) {
|
for(int i = 0; i < 3; i++) {
|
||||||
const auto n = c->neighbor(i);
|
const auto n = c->neighbor(i);
|
||||||
const auto n_index = n->index(c);
|
const auto n_index = n->index(c);
|
||||||
|
|
@ -1996,7 +2002,7 @@ public:
|
||||||
}
|
}
|
||||||
case 1: {
|
case 1: {
|
||||||
for(auto it = this->finite_edges_begin(), end = this->finite_edges_end(); it != end; ++it) {
|
for(auto it = this->finite_edges_begin(), end = this->finite_edges_end(); it != end; ++it) {
|
||||||
this->is_valid_finite((*it).first);
|
this->is_valid_finite((*it).first, verbose, level);
|
||||||
}
|
}
|
||||||
break;
|
break;
|
||||||
}
|
}
|
||||||
|
|
|
||||||
Loading…
Reference in New Issue