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

cell_iterator may circulate around the edge we want 

before actually moving to the next cell crossed by the query segment
This commit is contained in:
Jane Tournois 2016-11-29 17:54:35 +01:00
parent f3777a397c
commit 9e0f52546e
1 changed files with 18 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

18
Triangulation_3/include/CGAL/Triangulation_segment_traverser_3.h
View File

@ -676,6 +676,7 @@ public:
++_cell_iterator;
Cell_handle chnext = Cell_handle(_cell_iterator);
//_cell_iterator is one step forward _curr_simplex
CGAL_assertion(ch != chnext);
Locate_type lt;
int li, lj;
@ -686,6 +687,18 @@ public:
switch (lt)
{
case Locate_type::VERTEX:
while (index_v == index_vnext)//another cell with same vertex has been found
{
ch = chnext;
index_v = ch->index(get_vertex());
++_cell_iterator;
chnext = Cell_handle(_cell_iterator);
CGAL_assertion(ch != chnext);
_cell_iterator.entry(lt, li, lj);
CGAL_assertion(lt == Locate_type::VERTEX);
index_vnext = ch->index(chnext->vertex(li));
}
_curr_simplex = Edge(ch, index_v, index_vnext);
break;
case Locate_type::EDGE:
@ -775,6 +788,11 @@ public:
return false;
}
int simplex_dimension() const
{
return _curr_simplex.which();
}
private:
bool cell_iterator_is_ahead() const
{