mirror of https://github.com/CGAL/cgal
added tds() functions: const and non const access to the tds + test + doc
This commit is contained in:
parent
96771b1155
commit
541fc4b51a
|
|
@ -1,8 +1,11 @@
|
||||||
Package triangulation: provides triangulations Delaunay triangulations,
|
Package triangulation: provides triangulations Delaunay triangulations,
|
||||||
constrained and regular triangulations with tests and examples.
|
constrained and regular triangulations with tests and examples.
|
||||||
|
|
||||||
|
Ver 7.96
|
||||||
|
- added tds() functions: const and non const access to the tds + test + doc
|
||||||
|
|
||||||
Ver 7.95 (2/07/06)
|
Ver 7.95 (2/07/06)
|
||||||
- fixed rxpensive precondition in delete_face
|
- fixed expensive precondition in delete_face
|
||||||
- added is_face(Face_handle fh)
|
- added is_face(Face_handle fh)
|
||||||
is_edge(Face_handle fh, int i)
|
is_edge(Face_handle fh, int i)
|
||||||
- fixed the doc for that
|
- fixed the doc for that
|
||||||
|
|
|
||||||
|
|
@ -263,6 +263,24 @@ empty triangulation.}
|
||||||
\ccAccessFunctions
|
\ccAccessFunctions
|
||||||
\ccMethod{const Geom_traits& geom_traits() const;}
|
\ccMethod{const Geom_traits& geom_traits() const;}
|
||||||
{Returns a const reference to the triangulation traits object.}
|
{Returns a const reference to the triangulation traits object.}
|
||||||
|
\ccGlue
|
||||||
|
\ccMethod{const TriangulationDataStructure_2 & tds() const;}
|
||||||
|
{Returns a const reference to the triangulation data structure.}
|
||||||
|
|
||||||
|
\begin{ccAdvanced}
|
||||||
|
\ccHeading{Non const access}
|
||||||
|
The responsibility of keeping a valid triangulation belongs to the user
|
||||||
|
when using advanced operations allowing a direct manipulation of the \ccc{tds}.
|
||||||
|
|
||||||
|
\ccMethod{TriangulationDataStructure_2 & tds();}
|
||||||
|
{Returns a reference to the triangulation data structure.}
|
||||||
|
|
||||||
|
This method is mainly a help for users implementing their own triangulation
|
||||||
|
algorithms.
|
||||||
|
|
||||||
|
\end{ccAdvanced}
|
||||||
|
|
||||||
|
|
||||||
\ccGlue
|
\ccGlue
|
||||||
\ccMethod{int dimension() const;}
|
\ccMethod{int dimension() const;}
|
||||||
{Returns the dimension of the convex hull.}
|
{Returns the dimension of the convex hull.}
|
||||||
|
|
|
||||||
|
|
@ -263,6 +263,24 @@ empty triangulation.}
|
||||||
\ccAccessFunctions
|
\ccAccessFunctions
|
||||||
\ccMethod{const Geom_traits& geom_traits() const;}
|
\ccMethod{const Geom_traits& geom_traits() const;}
|
||||||
{Returns a const reference to the triangulation traits object.}
|
{Returns a const reference to the triangulation traits object.}
|
||||||
|
\ccGlue
|
||||||
|
\ccMethod{const TriangulationDataStructure_2 & tds() const;}
|
||||||
|
{Returns a const reference to the triangulation data structure.}
|
||||||
|
|
||||||
|
\begin{ccAdvanced}
|
||||||
|
\ccHeading{Non const access}
|
||||||
|
The responsibility of keeping a valid triangulation belongs to the user
|
||||||
|
when using advanced operations allowing a direct manipulation of the \ccc{tds}.
|
||||||
|
|
||||||
|
\ccMethod{TriangulationDataStructure_2 & tds();}
|
||||||
|
{Returns a reference to the triangulation data structure.}
|
||||||
|
|
||||||
|
This method is mainly a help for users implementing their own triangulation
|
||||||
|
algorithms.
|
||||||
|
|
||||||
|
\end{ccAdvanced}
|
||||||
|
|
||||||
|
|
||||||
\ccGlue
|
\ccGlue
|
||||||
\ccMethod{int dimension() const;}
|
\ccMethod{int dimension() const;}
|
||||||
{Returns the dimension of the convex hull.}
|
{Returns the dimension of the convex hull.}
|
||||||
|
|
|
||||||
|
|
@ -195,9 +195,12 @@ public:
|
||||||
|
|
||||||
|
|
||||||
//ACCESS FUNCTIONs
|
//ACCESS FUNCTIONs
|
||||||
|
const Geom_traits& geom_traits() const { return _gt;}
|
||||||
|
const Tds & tds() const { return _tds;}
|
||||||
|
Tds & tds() { return _tds;}
|
||||||
int dimension() const { return _tds.dimension();}
|
int dimension() const { return _tds.dimension();}
|
||||||
int number_of_vertices() const {return _tds.number_of_vertices() - 1;}
|
int number_of_vertices() const {return _tds.number_of_vertices() - 1;}
|
||||||
const Geom_traits& geom_traits() const { return _gt;}
|
|
||||||
int number_of_faces() const;
|
int number_of_faces() const;
|
||||||
Vertex_handle infinite_vertex() const;
|
Vertex_handle infinite_vertex() const;
|
||||||
Vertex_handle finite_vertex() const;
|
Vertex_handle finite_vertex() const;
|
||||||
|
|
|
||||||
|
|
@ -763,6 +763,10 @@ _test_cls_triangulation_2( const Triangul & )
|
||||||
T2_7.remove(T2_7.finite_vertex());
|
T2_7.remove(T2_7.finite_vertex());
|
||||||
assert( T2_7.number_of_vertices() == 0 );
|
assert( T2_7.number_of_vertices() == 0 );
|
||||||
|
|
||||||
|
//test access to tds
|
||||||
|
assert (T2_1.tds().is_valid());
|
||||||
|
assert (T1_5.tds().is_valid());
|
||||||
|
|
||||||
// test destructors and return
|
// test destructors and return
|
||||||
std::cout << " test destructors and return" << std::endl;
|
std::cout << " test destructors and return" << std::endl;
|
||||||
}
|
}
|
||||||
|
|
|
||||||
Loading…
Reference in New Issue