diff --git a/Convex_hull_d/include/CGAL/Convex_hull_d.h b/Convex_hull_d/include/CGAL/Convex_hull_d.h index 17d92202ed5..c497b5e064e 100644 --- a/Convex_hull_d/include/CGAL/Convex_hull_d.h +++ b/Convex_hull_d/include/CGAL/Convex_hull_d.h @@ -269,12 +269,15 @@ class Convex_hull_d : public Regular_complex_d typedef Regular_complex_d Base; typedef Convex_hull_d Self; -using Base::new_simplex; - public: -using Base::kernel; -using Base::dcur; + using Base::new_simplex; + using Base::new_vertex; + using Base::associate_vertex_with_simplex; + using Base::set_neighbor; + + using Base::kernel; + using Base::dcur; /*{\Xgeneralization Regular_complex_d}*/ /*{\Mtypes 6.5}*/ diff --git a/Convex_hull_d/include/CGAL/Delaunay_d.h b/Convex_hull_d/include/CGAL/Delaunay_d.h index ae58b3ccc0a..a5359059f87 100644 --- a/Convex_hull_d/include/CGAL/Delaunay_d.h +++ b/Convex_hull_d/include/CGAL/Delaunay_d.h @@ -93,11 +93,12 @@ class Delaunay_d : public Convex_hull_d typedef Delaunay_d Self; typedef Convex_hull_d Base; -using Base::origin_simplex_; + using Base::origin_simplex_; public: -using Base::dcur; + using Base::associate_vertex_with_simplex; + using Base::dcur; /*{\Mgeneralization Convex_hull_d}*/ diff --git a/Convex_hull_d/include/CGAL/Regular_complex_d.h b/Convex_hull_d/include/CGAL/Regular_complex_d.h index 9dca377ca10..0e7c73cd886 100644 --- a/Convex_hull_d/include/CGAL/Regular_complex_d.h +++ b/Convex_hull_d/include/CGAL/Regular_complex_d.h @@ -567,8 +567,8 @@ intersection of any two simplices is a facet of both.}*/ typedef size_t Size_type; -Size_type number_of_vertices() const { return this->_vertices.size();} -Size_type number_of_simplices() const { return this->_simplices.size();} +Size_type number_of_vertices() const { return this->vertices_.size();} +Size_type number_of_simplices() const { return this->simplices_.size();} void print_statistics(std::ostream& os = std::cout) const {