mirror of https://github.com/CGAL/cgal
std::cerr only if CGAL_MESH_3_VERBOSE
This commit is contained in:
parent
4ce2e8e416
commit
56285ef220
|
|
@ -649,9 +649,11 @@ public:
|
|||
}
|
||||
|
||||
void build_curves_aabb_tree() const {
|
||||
#if CGAL_MESH_3_VERBOSE
|
||||
std::cerr << "Building curves AABB tree...";
|
||||
CGAL::Real_timer timer;
|
||||
timer.start();
|
||||
#endif
|
||||
curves_aabb_tree_.clear();
|
||||
for(typename Edges::const_iterator
|
||||
edges_it = edges_.begin(),
|
||||
|
|
@ -669,9 +671,10 @@ public:
|
|||
}
|
||||
curves_aabb_tree_.build();
|
||||
curves_aabb_tree_is_built = true;
|
||||
#if CGAL_MESH_3_VERBOSE
|
||||
timer.stop();
|
||||
std::cerr << " done (" << timer.time() * 1000 << " ms)" << std::endl;
|
||||
|
||||
#endif
|
||||
} // end build_curves_aabb_tree()
|
||||
|
||||
private:
|
||||
|
|
|
|||
|
|
@ -464,9 +464,8 @@ add_features_from_split_graph_into_polylines(const Polyhedron& p,
|
|||
BOOST_FOREACH(Graph_edge_descriptor e, edges(graph)){
|
||||
vertex_descriptor vs = p2vmap[source(e,graph)->point()];
|
||||
vertex_descriptor vt = p2vmap[target(e,graph)->point()];
|
||||
if(vs == vt){
|
||||
std::cerr << "ignore self loop\n";
|
||||
}else{
|
||||
CGAL_warning_msg(vs != vt, "ignore self loop");
|
||||
if(vs != vt) {
|
||||
const std::pair<edge_descriptor, bool> pair = add_edge(vs,vt,g_copy);
|
||||
typename Polyhedron::Halfedge_handle he = halfedge(e, p);
|
||||
if(!is_border(he, p)) {
|
||||
|
|
|
|||
Loading…
Reference in New Issue