mirror of https://github.com/CGAL/cgal
use undirected_edges to have only one primitive per edge
This commit is contained in:
parent
0033b19157
commit
91dde8b2c0
|
|
@ -657,8 +657,8 @@ void Scene::generate_edge_points(const unsigned int nb_points)
|
|||
typedef Tree::Object_and_primitive_id Object_and_primitive_id;
|
||||
|
||||
std::cout << "Construct AABB tree...";
|
||||
Tree tree( boost::edges(*m_pPolyhedron).first,
|
||||
boost::edges(*m_pPolyhedron).second,
|
||||
Tree tree( CGAL::undirected_edges(*m_pPolyhedron).first,
|
||||
CGAL::undirected_edges(*m_pPolyhedron).second,
|
||||
*m_pPolyhedron);
|
||||
std::cout << "done." << std::endl;
|
||||
|
||||
|
|
|
|||
|
|
@ -11,6 +11,7 @@
|
|||
|
||||
#include <CGAL/AABB_tree.h>
|
||||
#include <CGAL/AABB_traits.h>
|
||||
#include <CGAL/boost/graph/halfedge_graph_traits_Polyhedron_3.h>
|
||||
#include <CGAL/AABB_HalfedgeGraph_segment_primitive.h>
|
||||
#include <CGAL/AABB_FaceGraph_triangle_primitive.h>
|
||||
|
||||
|
|
|
|||
|
|
@ -24,6 +24,7 @@
|
|||
#include <CGAL/AABB_tree.h>
|
||||
#include <CGAL/AABB_traits.h>
|
||||
#include <CGAL/AABB_HalfedgeGraph_segment_primitive.h>
|
||||
#include <CGAL/boost/graph/halfedge_graph_traits_Polyhedron_3.h>
|
||||
|
||||
#include <CGAL/Vector_3.h>
|
||||
#include <CGAL/Point_3.h>
|
||||
|
|
@ -418,8 +419,8 @@ public:
|
|||
*/
|
||||
Polyhedron_slicer_3(const Polyhedron& polyhedron, const Kernel& kernel = Kernel())
|
||||
: intersect_3_functor(kernel.intersect_3_object()),
|
||||
tree( boost::edges(polyhedron).first,
|
||||
boost::edges(polyhedron).second,
|
||||
tree( undirected_edges(polyhedron).first,
|
||||
undirected_edges(polyhedron).second,
|
||||
polyhedron)
|
||||
{ }
|
||||
|
||||
|
|
|
|||
Loading…
Reference in New Issue