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

fix compilation issues

This commit is contained in:
Sébastien Loriot 2024-01-30 17:36:41 +01:00
parent ef1fc52278
commit 3763febfa8
2 changed files with 4 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
Orthtree/include/CGAL/Orthtree.h
View File

@ -485,7 +485,7 @@ public:
Cartesian_coordinate min_corner, max_corner; Cartesian_coordinate min_corner, max_corner;
std::size_t node_depth = depth(n); std::size_t node_depth = depth(n);
for (int i = 0; i < Dimension::value; i++) for (int i = 0; i < dimension; i++)
{ {
min_corner[i]=compute_cartesian_coordinate(global_coordinates(n)[i], node_depth, i); min_corner[i]=compute_cartesian_coordinate(global_coordinates(n)[i], node_depth, i);
max_corner[i]=compute_cartesian_coordinate(global_coordinates(n)[i]+1, node_depth, i); max_corner[i]=compute_cartesian_coordinate(global_coordinates(n)[i]+1, node_depth, i);
@ -978,8 +978,8 @@ public:
Point barycenter(Node_index n) const { Point barycenter(Node_index n) const {
std::size_t node_depth = depth(n); std::size_t node_depth = depth(n);
// the barycenter is computed as the lower corner of the lexicographically top child node // the barycenter is computed as the lower corner of the lexicographically top child node
std::array<FT, Dimension::value> bary; std::array<FT, dimension> bary;
for (std::size_t i = 0; i < Dimension::value; i++) for (std::size_t i = 0; i < dimension; i++)
bary[i] = compute_cartesian_coordinate(2 * global_coordinates(n)[i]+1, node_depth+1, i); bary[i] = compute_cartesian_coordinate(2 * global_coordinates(n)[i]+1, node_depth+1, i);
return std::apply(m_traits.construct_point_d_object(), bary); return std::apply(m_traits.construct_point_d_object(), bary);

2
Orthtree/include/CGAL/Orthtree_traits_face_graph.h
View File

@ -74,7 +74,7 @@ struct Orthtree_traits_face_graph : public Orthtree_traits_base_for_dimension<
auto construct_root_node_bbox_object() const { auto construct_root_node_bbox_object() const {
return [&]() -> Bbox_d { return [&]() -> Bbox_d {
std::array<FT, dimension> min = {0.0, 0}, max = {0.0, 0}; std::array<FT, Base::dimension> min = {0.0, 0}, max = {0.0, 0};
if (faces(m_pm).begin() != faces(m_pm).end()) { if (faces(m_pm).begin() != faces(m_pm).end()) {
const Point_d& p = get(m_vpm, *vertices(m_pm).begin()); const Point_d& p = get(m_vpm, *vertices(m_pm).begin());
min = {p.x(), p.y(), p.z()}; min = {p.x(), p.y(), p.z()};