mirror of https://github.com/CGAL/cgal
version version of traits for triangle meshes
example currently segfault, to be debugged...
This commit is contained in:
Sébastien Loriot
parent
3e4120c81d
commit
4e1dabe0c0
|
|
@ -15,6 +15,7 @@ create_single_source_cgal_program("octree_traversal_manual.cpp")
|
||||||
create_single_source_cgal_program("octree_traversal_preorder.cpp")
|
create_single_source_cgal_program("octree_traversal_preorder.cpp")
|
||||||
create_single_source_cgal_program("octree_grade.cpp")
|
create_single_source_cgal_program("octree_grade.cpp")
|
||||||
create_single_source_cgal_program("quadtree_build_from_point_vector.cpp")
|
create_single_source_cgal_program("quadtree_build_from_point_vector.cpp")
|
||||||
|
create_single_source_cgal_program("octree_surface_mesh.cpp")
|
||||||
|
|
||||||
find_package(Eigen3 3.1.91 QUIET) #(requires 3.1.91 or greater)
|
find_package(Eigen3 3.1.91 QUIET) #(requires 3.1.91 or greater)
|
||||||
include(CGAL_Eigen_support)
|
include(CGAL_Eigen_support)
|
||||||
|
|
|
||||||
|
|
@ -0,0 +1,69 @@
|
||||||
|
#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
|
||||||
|
#include <CGAL/Surface_mesh.h>
|
||||||
|
|
||||||
|
#include <CGAL/Octree.h>
|
||||||
|
#include <CGAL/Orthtree_traits_face_graph.h>
|
||||||
|
|
||||||
|
#include <CGAL/boost/graph/IO/polygon_mesh_io.h>
|
||||||
|
|
||||||
|
using K = CGAL::Exact_predicates_inexact_constructions_kernel;
|
||||||
|
using Mesh = CGAL::Surface_mesh<K::Point_3>;
|
||||||
|
|
||||||
|
using OTraits = CGAL::Orthtree_traits_face_graph<Mesh, Mesh::Property_map<Mesh::Vertex_index, K::Point_3>>;
|
||||||
|
using Octree = CGAL::Orthtree<OTraits>;
|
||||||
|
|
||||||
|
void dump_as_polylines(const Octree& ot)
|
||||||
|
{
|
||||||
|
// SL: I cheated for this part and looked at the implementation
|
||||||
|
std::ofstream out("octree.polylines.txt");
|
||||||
|
for (Octree::Node_index node : ot.traverse_indices(CGAL::Orthtrees::Leaves_traversal<Octree>(ot)))
|
||||||
|
{
|
||||||
|
if (!ot.is_leaf(node))
|
||||||
|
continue;
|
||||||
|
CGAL::Bbox_3 bb = ot.bbox(node);
|
||||||
|
out << "2 " << bb.xmin() << " " << bb.ymin() << " " << bb.zmin()
|
||||||
|
<< " " << bb.xmax() << " " << bb.ymin() << " " << bb.zmin();
|
||||||
|
out << "2 " << bb.xmin() << " " << bb.ymin() << " " << bb.zmin()
|
||||||
|
<< " " << bb.xmin() << " " << bb.ymax() << " " << bb.zmin();
|
||||||
|
out << "2 " << bb.xmin() << " " << bb.ymin() << " " << bb.zmin()
|
||||||
|
<< " " << bb.xmin() << " " << bb.ymin() << " " << bb.zmax();
|
||||||
|
out << "2 " << bb.xmax() << " " << bb.ymin() << " " << bb.zmin()
|
||||||
|
<< " " << bb.xmax() << " " << bb.ymax() << " " << bb.zmin();
|
||||||
|
out << "2 " << bb.xmax() << " " << bb.ymin() << " " << bb.zmin()
|
||||||
|
<< " " << bb.xmax() << " " << bb.ymin() << " " << bb.zmax();
|
||||||
|
out << "2 " << bb.xmin() << " " << bb.ymax() << " " << bb.zmin()
|
||||||
|
<< " " << bb.xmin() << " " << bb.ymax() << " " << bb.zmax();
|
||||||
|
out << "2 " << bb.xmin() << " " << bb.ymax() << " " << bb.zmin()
|
||||||
|
<< " " << bb.xmax() << " " << bb.ymax() << " " << bb.zmin();
|
||||||
|
out << "2 " << bb.xmax() << " " << bb.ymax() << " " << bb.zmin()
|
||||||
|
<< " " << bb.xmax() << " " << bb.ymax() << " " << bb.zmax();
|
||||||
|
out << "2 " << bb.xmin() << " " << bb.ymin() << " " << bb.zmax()
|
||||||
|
<< " " << bb.xmax() << " " << bb.ymin() << " " << bb.zmax();
|
||||||
|
out << "2 " << bb.xmin() << " " << bb.ymin() << " " << bb.zmin()
|
||||||
|
<< " " << bb.xmin() << " " << bb.ymax() << " " << bb.zmin();
|
||||||
|
out << "2 " << bb.xmax() << " " << bb.ymin() << " " << bb.zmax()
|
||||||
|
<< " " << bb.xmin() << " " << bb.ymin() << " " << bb.zmax();
|
||||||
|
out << "2 " << bb.xmax() << " " << bb.ymin() << " " << bb.zmax()
|
||||||
|
<< " " << bb.xmax() << " " << bb.ymax() << " " << bb.zmax();
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
int main(int argc, char** argv)
|
||||||
|
{
|
||||||
|
const std::string filename = (argc > 1) ? argv[1] : CGAL::data_file_path("meshes/elephant.off");
|
||||||
|
|
||||||
|
Mesh mesh;
|
||||||
|
if(!CGAL::IO::read_polygon_mesh(filename, mesh))
|
||||||
|
{
|
||||||
|
std::cerr << "Error: cannot read file" << std::endl;
|
||||||
|
return EXIT_FAILURE;
|
||||||
|
}
|
||||||
|
|
||||||
|
OTraits otraits(mesh, mesh.points());
|
||||||
|
|
||||||
|
Octree tree(otraits);
|
||||||
|
OTraits::Split_predicate_node_min_extent sp(0.01);
|
||||||
|
tree.refine(sp);
|
||||||
|
|
||||||
|
dump_as_polylines(tree);
|
||||||
|
}
|
||||||
|
|
@ -0,0 +1,155 @@
|
||||||
|
// Copyright (c) 2023 INRIA (France).
|
||||||
|
// All rights reserved.
|
||||||
|
//
|
||||||
|
// This file is part of CGAL (www.cgal.org).
|
||||||
|
//
|
||||||
|
// $URL$
|
||||||
|
// $Id$
|
||||||
|
// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
|
||||||
|
//
|
||||||
|
// Author(s) : Sebastien LORIOT
|
||||||
|
|
||||||
|
|
||||||
|
#ifndef CGAL_ORTHREE_TRAITS_FACE_GRAPH_H
|
||||||
|
#define CGAL_ORTHREE_TRAITS_FACE_GRAPH_H
|
||||||
|
|
||||||
|
#include <CGAL/Dimension.h>
|
||||||
|
#include <CGAL/Bbox_3.h>
|
||||||
|
|
||||||
|
namespace CGAL
|
||||||
|
{
|
||||||
|
|
||||||
|
template <class PolygonMesh, class VPM>
|
||||||
|
struct Orthtree_traits_face_graph
|
||||||
|
{
|
||||||
|
Orthtree_traits_face_graph(const PolygonMesh& pm, VPM vpm)
|
||||||
|
: m_pm(pm)
|
||||||
|
, m_vpm(vpm)
|
||||||
|
{}
|
||||||
|
|
||||||
|
|
||||||
|
using Point_d = typename boost::property_traits<VPM>::value_type;
|
||||||
|
using Geom_traits = typename Kernel_traits<Point_d>::type;
|
||||||
|
using Dimension = Dimension_tag<3>;
|
||||||
|
using Bbox_d = Bbox_3;
|
||||||
|
using FT = typename Geom_traits::FT;
|
||||||
|
using Sphere_d = typename Geom_traits::Sphere_3; // SL: why?
|
||||||
|
using Array = std::array<FT, 3>; // SL: why?
|
||||||
|
using Cartesian_const_iterator_d = typename Geom_traits::Cartesian_const_iterator_3;
|
||||||
|
// SL: these could be considered as built-in data and if the typedefs are not present, the tree have none
|
||||||
|
using Node_data_element = typename boost::graph_traits<PolygonMesh>::face_descriptor;
|
||||||
|
using Node_data = std::vector<Node_data_element>;
|
||||||
|
|
||||||
|
struct Construct_bbox_d {
|
||||||
|
Bbox_d operator()(const Array& min,
|
||||||
|
const Array& max) const {
|
||||||
|
return Bbox_d(min[0], min[1], min[2], max[0], max[1], max[2]);
|
||||||
|
}
|
||||||
|
};
|
||||||
|
|
||||||
|
// SL: why?
|
||||||
|
struct Construct_point_d_from_array {
|
||||||
|
Point_d operator()(const Array& array) const {
|
||||||
|
return Point_d(array[0], array[1], array[2]);
|
||||||
|
}
|
||||||
|
};
|
||||||
|
|
||||||
|
Construct_point_d_from_array construct_point_d_from_array_object() const { return Construct_point_d_from_array(); }
|
||||||
|
Construct_bbox_d construct_bbox_d_object() const { return Construct_bbox_d(); }
|
||||||
|
|
||||||
|
// SL: why in each traits? because it's dimension dependant?
|
||||||
|
enum Adjacency {
|
||||||
|
LEFT,
|
||||||
|
RIGHT,
|
||||||
|
DOWN,
|
||||||
|
UP,
|
||||||
|
BACK,
|
||||||
|
FRONT
|
||||||
|
};
|
||||||
|
|
||||||
|
std::pair<Array, Array> root_node_bbox() const
|
||||||
|
{
|
||||||
|
Array min={0.0,0}, max={0.0,0};
|
||||||
|
if (faces(m_pm).begin()!=faces(m_pm).end())
|
||||||
|
{
|
||||||
|
const Point_d& p = get(m_vpm, *vertices(m_pm).begin());
|
||||||
|
min={p.x(), p.y(), p.z()};
|
||||||
|
max=min;
|
||||||
|
for (auto v : vertices(m_pm))
|
||||||
|
{
|
||||||
|
const Point_d& p_v = get(m_vpm, v);
|
||||||
|
for (int i=0; i<3; ++i)
|
||||||
|
{
|
||||||
|
if (p_v[i]<min[i]) min[i]=p_v[i];
|
||||||
|
if (p_v[i]>max[i]) max[i]=p_v[i];
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
return {min, max};
|
||||||
|
}
|
||||||
|
|
||||||
|
// SL: not clear to me what it should do from the doc
|
||||||
|
Node_data root_node_contents()
|
||||||
|
{
|
||||||
|
return {faces(m_pm).begin(), faces(m_pm).end()};
|
||||||
|
}
|
||||||
|
|
||||||
|
template<class NodeIndex, class Tree>
|
||||||
|
void distribute_node_contents(NodeIndex n, Tree &tree, const Point_d ¢er)
|
||||||
|
{
|
||||||
|
Node_data& ndata = tree.data(n);
|
||||||
|
for (int i=0; i<8; ++i)
|
||||||
|
{
|
||||||
|
NodeIndex child = tree.child(n, i);
|
||||||
|
Node_data& child_data = tree.data(child);
|
||||||
|
Bbox_d bbox = tree.bbox(child);
|
||||||
|
for (Node_data_element f : ndata)
|
||||||
|
{
|
||||||
|
typename boost::graph_traits<PolygonMesh>::halfedge_descriptor
|
||||||
|
h = halfedge(f, m_pm);
|
||||||
|
typename Geom_traits::Triangle_3 t(get(m_vpm, source(h, m_pm)),
|
||||||
|
get(m_vpm, target(h, m_pm)),
|
||||||
|
get(m_vpm, target(next(h, m_pm), m_pm)));
|
||||||
|
if(do_intersect(t, bbox))
|
||||||
|
child_data.push_back(f);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
//SL: I find convenient to put it here
|
||||||
|
class Split_predicate_node_min_extent {
|
||||||
|
|
||||||
|
FT m_min_extent;
|
||||||
|
|
||||||
|
public:
|
||||||
|
|
||||||
|
Split_predicate_node_min_extent(FT me)
|
||||||
|
: m_min_extent(me)
|
||||||
|
{}
|
||||||
|
|
||||||
|
/*!
|
||||||
|
\brief returns `true` if `ni` should be split, `false` otherwise.
|
||||||
|
*/
|
||||||
|
template<typename Node_index, typename Tree>
|
||||||
|
bool operator()(Node_index ni, const Tree &tree) const
|
||||||
|
{
|
||||||
|
if (tree.data(ni).empty()) return false;
|
||||||
|
|
||||||
|
Bbox_d bb = tree.bbox(ni);
|
||||||
|
//TODO: we should get better version to get guarantees
|
||||||
|
for (int i=0; i<3; ++i)
|
||||||
|
if ( (bb.max(i) - bb.min(i)) < 2*m_min_extent )
|
||||||
|
return false;
|
||||||
|
return true;
|
||||||
|
}
|
||||||
|
};
|
||||||
|
|
||||||
|
const PolygonMesh& m_pm;
|
||||||
|
VPM m_vpm;
|
||||||
|
};
|
||||||
|
|
||||||
|
} // end of CGAL namespace
|
||||||
|
|
||||||
|
|
||||||
|
#endif // CGAL_ORTHREE_TRAITS_FACE_GRAPH_H
|
||||||
Loading…
Reference in New Issue