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

is_edge(c,i,j) & is_facet(c,i) added

This commit is contained in:
Monique Teillaud 1999-10-13 09:08:21 +00:00
parent bc0cf7781b
commit 79db490fb8
1 changed files with 47 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

51
Packages/Triangulation_3/include/CGAL/Triangulation_data_structure_3.h
View File

@ -271,10 +271,16 @@ public:
bool is_vertex(Vertex* v) const;
bool is_edge(Cell* c, int i, int j) const;
// returns false when dimension <1 or when indices wrong
bool is_edge(Vertex* u, Vertex* v,
Cell* & c, int & i, int & j) const;
// returns false when dimension <1
bool is_facet(Cell* c, int i) const;
// returns false when dimension <2 or when indices wrong
bool is_facet(Vertex* u, Vertex* v, Vertex* w,
Cell* & c, int & i, int & j, int & k) const;
// returns false when dimension <2
@ -741,6 +747,26 @@ is_edge(Vertex* u, Vertex* v,
return false;
}
template < class Vb, class Cb>
bool
Triangulation_data_structure_3<Vb,Cb>::
is_edge(Cell* c, int i, int j) const
// returns false when dimension <1
{
if ( i==j ) return false;
if ( (i<0) || (j<0) ) return false;
if ( (dimension() == 1) && ((i>1) || (j>1)) ) return false;
if ( (dimension() == 2) && ((i>2) || (j>2)) ) return false;
if ((i>3) || (j>3)) return false;
Edge_iterator it = edges_begin();
while ( it != edges_end() ) {
if ( &((*it).first) == c ) return true;
++it;
}
return false;
}
template < class Vb, class Cb>
bool
Triangulation_data_structure_3<Vb,Cb>::
@ -761,6 +787,23 @@ is_facet(Vertex* u, Vertex* v, Vertex* w,
return false;
}
template < class Vb, class Cb>
bool
Triangulation_data_structure_3<Vb,Cb>::
is_facet(Cell* c, int i) const
// returns false when dimension <2
{
if (i<0) return false;
if ( (dimension() == 2) && (i!=3) ) return false;
if (i>3) return false;
Facet_iterator it = facets_begin();
while ( it != facets_end() ) {
if ( &((*it).first) == c ) return true;
++it;
}
return false;
}
template < class Vb, class Cb>
bool
Triangulation_data_structure_3<Vb,Cb>::
@ -1504,7 +1547,7 @@ insert_in_facet(const Vertex & w, Cell* c, int i)
}
case 2:
{
CGAL_triangulation_precondition( i == 3 );
CGAL_triangulation_expensive_precondition( is_facet(c,i) );
Cell* n = c->neighbor(2);
Cell* cnew = create_cell(c->vertex(0),c->vertex(1),v,NULL,
c, NULL,n,NULL);
@ -1613,7 +1656,7 @@ insert_in_edge(const Vertex & w, Cell* c, int i, int j)
case 2:
{
CGAL_triangulation_precondition( i>=0 && i<=2 && j>=0 && j<=2 );
CGAL_triangulation_expensive_precondition( is_edge(c,i,j) );
int k=3-i-j; // index of the third vertex of the facet
Cell* d = c->neighbor(k);
int kd = d->index(c);
@ -1654,7 +1697,7 @@ insert_in_edge(const Vertex & w, Cell* c, int i, int j)
case 1:
{
CGAL_triangulation_precondition( (i==0 || i==1) && (j==0 || j==1) );
CGAL_triangulation_expensive_precondition( is_edge(c,i,j) );
cnew = create_cell(v,c->vertex(1),NULL,NULL,
c->neighbor(0),c,NULL,NULL);
c->vertex(1)->set_cell(cnew);