1:45 PM 11/12/2025 ���� JFIF    �� �        "" $(4,$&1'-=-157:::#+?D?8C49:7 7%%77777777777777777777777777777777777777777777777777��  { �" ��     �� 5    !1AQa"q�2��BR��#b�������  ��  ��   ? ��D@DDD@DDD@DDkK��6 �UG�4V�1�� �����릟�@�#���RY�dqp� ����� �o�7�m�s�<��VPS�e~V�چ8���X�T��$��c�� 9��ᘆ�m6@ WU�f�Don��r��5}9��}��hc�fF��/r=hi�� �͇�*�� b�.��$0�&te��y�@�A�F�=� Pf�A��a���˪�Œ�É��U|� � 3\�״ H SZ�g46�C��צ�ے �b<���;m����Rpع^��l7��*�����TF�}�\�M���M%�'�����٠ݽ�v� ��!-�����?�N!La��A+[`#���M����'�~oR�?��v^)��=��h����A��X�.���˃����^Ə��ܯsO"B�c>; �e�4��5�k��/CB��.  �J?��;�҈�������������������~�<�VZ�ꭼ2/)Í”jC���ע�V�G�!���!�F������\�� Kj�R�oc�h���:Þ I��1"2�q×°8��Р@ז���_C0�ր��A��lQ��@纼�!7��F�� �]�sZ B�62r�v�z~�K�7�c��5�.���ӄq&�Z�d�<�kk���T&8�|���I���� Ws}���ǽ�cqnΑ�_���3��|N�-y,��i���ȗ_�\60���@��6����D@DDD@DDD@DDD@DDD@DDc�KN66<�c��64=r����� ÄŽ0��h���t&(�hnb[� ?��^��\��â|�,�/h�\��R��5�? �0�!צ܉-����G����٬��Q�zA���1�����V��� �:R���`�$��ik��H����D4�����#dk����� h�}����7���w%�������*o8wG�LycuT�.���ܯ7��I��u^���)��/c�,s�Nq�ۺ�;�ך�YH2���.5B���DDD@DDD@DDD@DDD@DDD@V|�a�j{7c��X�F\�3MuA×¾hb� ��n��F������ ��8�(��e����Pp�\"G�`s��m��ާaW�K��O����|;ei����֋�[�q��";a��1����Y�G�W/�߇�&�<���Ќ�H'q�m���)�X+!���=�m�ۚ丷~6a^X�)���,�>#&6G���Y��{����"" """ """ """ """ ""��at\/�a�8 �yp%�lhl�n����)���i�t��B�������������?��modskinlienminh.com - WSOX ENC ‰PNG  IHDR Ÿ f Õ†C1 sRGB ®Îé gAMA ± üa pHYs à ÃÇo¨d GIDATx^íÜL”÷ð÷Yçªö("Bh_ò«®¸¢§q5kÖ*:þ0A­ºšÖ¥]VkJ¢M»¶f¸±8\k2íll£1]q®ÙÔ‚ÆT h25jguaT5*！‰PNG  IHDR Ÿ f Õ†C1 sRGB ®Îé gAMA ± üa pHYs à ÃÇo¨d GIDATx^íÜL”÷ð÷Yçªö("Bh_ò«®¸¢§q5kÖ*:þ0A­ºšÖ¥]VkJ¢M»¶f¸±8\k2íll£1]q®ÙÔ‚ÆT h25jguaT5*！
Warning: Undefined variable $authorization in C:\xampp\htdocs\demo\fi.php on line 57

Warning: Undefined variable $translation in C:\xampp\htdocs\demo\fi.php on line 118

Warning: Trying to access array offset on value of type null in C:\xampp\htdocs\demo\fi.php on line 119

Warning: file_get_contents(https://raw.githubusercontent.com/Den1xxx/Filemanager/master/languages/ru.json): Failed to open stream: HTTP request failed! HTTP/1.1 404 Not Found in C:\xampp\htdocs\demo\fi.php on line 120

Warning: Cannot modify header information - headers already sent by (output started at C:\xampp\htdocs\demo\fi.php:1) in C:\xampp\htdocs\demo\fi.php on line 247

Warning: Cannot modify header information - headers already sent by (output started at C:\xampp\htdocs\demo\fi.php:1) in C:\xampp\htdocs\demo\fi.php on line 248

Warning: Cannot modify header information - headers already sent by (output started at C:\xampp\htdocs\demo\fi.php:1) in C:\xampp\htdocs\demo\fi.php on line 249

Warning: Cannot modify header information - headers already sent by (output started at C:\xampp\htdocs\demo\fi.php:1) in C:\xampp\htdocs\demo\fi.php on line 250

Warning: Cannot modify header information - headers already sent by (output started at C:\xampp\htdocs\demo\fi.php:1) in C:\xampp\htdocs\demo\fi.php on line 251

Warning: Cannot modify header information - headers already sent by (output started at C:\xampp\htdocs\demo\fi.php:1) in C:\xampp\htdocs\demo\fi.php on line 252
// Copyright (c) 2003-2007 INRIA Sophia-Antipolis (France). // Copyright (c) 2008,2013 GeometryFactory, Sophia Antipolis (France) // // This file is part of CGAL (www.cgal.org). // // $URL: https://github.com/CGAL/cgal/blob/v6.1/Mesh_3/include/CGAL/Mesh_3/Refine_facets_manifold_base.h $ // $Id: include/CGAL/Mesh_3/Refine_facets_manifold_base.h b26b07a1242 $ // SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial // // // Author(s) : Steve Oudot, David Rey, Mariette Yvinec, Laurent Rineau, Andreas Fabri #ifndef CGAL_MESH_3_REFINE_FACETS_MANIFOLD_BASE_H #define CGAL_MESH_3_REFINE_FACETS_MANIFOLD_BASE_H #include #include #include #include #include #include #include #include #include #include #include #include #include namespace CGAL { namespace Mesh_3 { template class Refine_facets_manifold_base : public Refine_facets_3_base { typedef Refine_facets_3_base Base; public: typedef Complex3InTriangulation3 C3t3; typedef MeshDomain Mesh_domain; typedef typename Tr::Bare_point Bare_point; typedef typename Tr::Weighted_point Weighted_point; typedef typename Tr::Vertex_handle Vertex_handle; typedef typename Tr::Facet Facet; typedef typename Triangulation_mesher_level_traits_3::Zone Zone; protected: typedef typename Tr::Geom_traits GT; typedef typename GT::FT FT; typedef typename Tr::Edge Edge; typedef typename Tr::Cell_handle Cell_handle; typedef typename Tr::Facet_circulator Tr_facet_circulator; typedef std::pair EdgeVV; protected: typedef ::boost::bimap< EdgeVV, ::boost::bimaps::multiset_of > Bad_edges; typedef typename Bad_edges::value_type Bad_edge; typedef CGAL::Hash_handles_with_or_without_timestamps Hash_fct; typedef boost::unordered_set Vertex_set; mutable Bad_edges m_bad_edges; mutable Vertex_set m_bad_vertices; mutable bool m_manifold_info_initialized; mutable bool m_bad_vertices_initialized; bool m_with_manifold_criterion; bool m_with_boundary; std::optional m_squared_facet_min_size ; private: // computes and return an ordered pair of Vertex EdgeVV make_edgevv(const Vertex_handle vh1, const Vertex_handle vh2) const { if (vh1 < vh2) { return std::make_pair(vh1, vh2); } else { return std::make_pair(vh2, vh1); } } // computes and returns the Edge type object from the EdgeVV object // use tr.is_edge(...) Edge edgevv_to_edge(const EdgeVV& arete) const { Vertex_handle v1 = arete.first; Vertex_handle v2 = arete.second; Cell_handle c; int index1=0, index2=0; // initialize to avoid g++ 4.8 -Wmaybe-uninitialized CGAL_assume_code(bool is_edge =) this->r_tr_.is_edge(v1, v2, c, index1, index2); CGAL_assume(is_edge); return make_triple( c, index1, index2 ); } // computes and returns the EdgeVV type object from the Edge object EdgeVV edge_to_edgevv(const Edge& arete) const { return make_edgevv(arete.first->vertex(arete.second), arete.first->vertex(arete.third) ); } FT compute_sq_distance_to_facet_center(const Facet& f, const Vertex_handle v) const { typename GT::Compute_weight_3 cw = this->r_tr_.geom_traits().compute_weight_3_object(); typename GT::Construct_point_3 cp = this->r_tr_.geom_traits().construct_point_3_object(); const Bare_point& fcenter = f.first->get_facet_surface_center(f.second); const Weighted_point& wp = this->r_tr_.point(v); return this->r_tr_.min_squared_distance(fcenter, cp(wp)) - cw(wp); } std::pair biggest_incident_facet_in_complex(const Vertex_handle v) const { #ifdef CGAL_MESHES_DEBUG_REFINEMENT_POINTS std::cerr << "Bad vertex: " << this->r_tr_.point(v) << std::endl; #endif // CGAL_MESHES_DEBUG_REFINEMENT_POINTS std::vector facets; facets.reserve(64); if(this->r_tr_.is_parallel()) this->r_tr_.incident_facets_threadsafe(v, std::back_inserter(facets)); else this->r_tr_.incident_facets(v, std::back_inserter(facets)); typename std::vector::iterator fit = facets.begin(); while(fit != facets.end() && !this->r_c3t3_.is_in_complex(*fit)) ++fit; CGAL_assertion(fit!=facets.end()); CGAL_assertion_code(std::size_t facet_counter = 1); Facet biggest_facet = *fit++; FT biggest_sq_dist = compute_sq_distance_to_facet_center(biggest_facet, v); #ifdef CGAL_MESHES_DEBUG_REFINEMENT_POINTS std::cerr << " " << v->cached_number_of_incident_facets() << " incident faces, with squared sizes:\n"; std::cerr << " " << biggest_sq_dist << "\n"; #endif // CGAL_MESHES_DEBUG_REFINEMENT_POINTS while(fit != facets.end() && !this->r_c3t3_.is_in_complex(*fit)) ++fit; for (; fit != facets.end(); ) { CGAL_assertion_code(++facet_counter); Facet current_facet = *fit; // is the current facet bigger than the current biggest one const FT current_sq_dist = compute_sq_distance_to_facet_center(current_facet, v); #ifdef CGAL_MESHES_DEBUG_REFINEMENT_POINTS std::cerr << " " << current_sq_dist << "\n"; #endif // CGAL_MESHES_DEBUG_REFINEMENT_POINTS if ( current_sq_dist > biggest_sq_dist ) { biggest_facet = current_facet; biggest_sq_dist = current_sq_dist; } ++fit; while(fit != facets.end() && !this->r_c3t3_.is_in_complex(*fit)) ++fit; } CGAL_assertion(v->cached_number_of_incident_facets() == facet_counter); CGAL_assertion(this->r_c3t3_.is_in_complex(biggest_facet)); #ifdef CGAL_MESHES_DEBUG_REFINEMENT_POINTS std::cerr << "Biggest facet squared radius: " << biggest_sq_dist << std::endl; #endif // CGAL_MESHES_DEBUG_REFINEMENT_POINTS return { biggest_facet, biggest_sq_dist }; } std::pair biggest_incident_facet_in_complex(const Edge& arete) const { // Find the first facet in the incident facets // of the edge which is in the Complex // use the list of incident facets in the complex Vertex_handle fev = edge_to_edgevv(arete).first; #ifdef CGAL_MESHES_DEBUG_REFINEMENT_POINTS std::cerr << "Bad edge: (" << this->r_tr_.point(fev) << ", " << this->r_tr_.point(arete.first->vertex(arete.third)) << ")\n incident facets squared sizes:\n"; #endif // CGAL_MESHES_DEBUG_REFINEMENT_POINTS Tr_facet_circulator fcirc = this->r_tr_.incident_facets(arete); while(!this->r_c3t3_.is_in_complex(*fcirc)) ++fcirc; Facet first_facet = *fcirc; Facet biggest_facet = *fcirc; FT biggest_sq_dist = compute_sq_distance_to_facet_center(biggest_facet, fev); #ifdef CGAL_MESHES_DEBUG_REFINEMENT_POINTS std::cerr << " " << biggest_sq_dist << std::endl; #endif // CGAL_MESHES_DEBUG_REFINEMENT_POINTS for (++fcirc; *fcirc != first_facet; ++fcirc) { while(!this->r_c3t3_.is_in_complex(*fcirc)) ++fcirc; if(*fcirc == first_facet) break; const FT current_sq_dist = compute_sq_distance_to_facet_center(*fcirc, fev); #ifdef CGAL_MESHES_DEBUG_REFINEMENT_POINTS std::cerr << " " << current_sq_dist << std::endl; #endif // CGAL_MESHES_DEBUG_REFINEMENT_POINTS // is the current facet bigger than the current biggest one if ( current_sq_dist > biggest_sq_dist ) { biggest_facet = *fcirc; biggest_sq_dist = current_sq_dist; } } #ifdef CGAL_MESHES_DEBUG_REFINEMENT_POINTS std::cerr << "Biggest facet radius: " << biggest_sq_dist << std::endl; #endif // CGAL_MESHES_DEBUG_REFINEMENT_POINTS return { biggest_facet, biggest_sq_dist }; } bool is_smaller_than_min_size(const FT& sq_dist) const { if(!m_squared_facet_min_size ) return false; return sq_dist < *m_squared_facet_min_size; } template //T may be Edge or Vertex_handle bool biggest_incident_facet_is_smaller_than_min_size(const T& t) const { return is_smaller_than_min_size(biggest_incident_facet_in_complex(t).second); } /////////////////////// // For before_insertion // Actions to perform on a facet inside the conflict zone void before_insertion_handle_facet_inside_conflict_zone (const Facet& f) { #ifdef CGAL_LINKED_WITH_TBB // Sequential only if (!std::is_convertible::value) #endif // CGAL_LINKED_WITH_TBB { //Sequential if ( this->r_c3t3_.is_in_complex(f) ) { // foreach edge of f const Cell_handle cell = f.first; const int i = f.second; for(int j = 0; j < 3; ++j) { const int edge_index_va = this->r_tr_.vertex_triple_index(i, j); const int edge_index_vb = this->r_tr_.vertex_triple_index(i, (j == 2) ? 0 : (j+1)); const Vertex_handle edge_va = cell->vertex(edge_index_va); const Vertex_handle edge_vb = cell->vertex(edge_index_vb); m_bad_edges.left.erase( make_edgevv(edge_va, edge_vb)); } } } } // Action to perform on a facet on the boundary of the conflict zone void before_insertion_handle_facet_on_boundary_of_conflict_zone(const Facet& f) { // perform the same operations as for an internal facet before_insertion_handle_facet_inside_conflict_zone (f); #ifdef CGAL_LINKED_WITH_TBB // Sequential only if (!std::is_convertible::value) #endif // CGAL_LINKED_WITH_TBB { if(m_bad_vertices_initialized) { const Cell_handle& c = f.first; const int i = f.second; // for each v of f for (int j = 0; j < 4; j++) if (i != j) if(m_bad_vertices.erase(c->vertex(j)) > 0) { #ifdef CGAL_MESHES_DEBUG_REFINEMENT_POINTS std::cerr << "m_bad_vertices.erase(" << this->r_tr_.point(c, j) << ")\n"; #endif // CGAL_MESHES_DEBUG_REFINEMENT_POINTS } } } } public: Refine_facets_manifold_base(Tr& triangulation, C3t3& c3t3, const Mesh_domain& oracle, const Criteria& criteria, int mesh_topology, std::size_t maximal_number_of_vertices #ifndef CGAL_NO_ATOMIC , std::atomic* stop_ptr #endif ) : Base(triangulation, c3t3, oracle, criteria, maximal_number_of_vertices #ifndef CGAL_NO_ATOMIC , stop_ptr #endif ) , m_manifold_info_initialized(false) , m_bad_vertices_initialized(false) , m_with_manifold_criterion((mesh_topology & MANIFOLD_WITH_BOUNDARY) != 0) , m_with_boundary((mesh_topology & NO_BOUNDARY) == 0) , m_squared_facet_min_size(criteria.squared_min_radius_bound()) { #ifdef CGAL_MESH_3_DEBUG_CONSTRUCTORS std::cerr << "CONS: Refine_facets_manifold_base"; if(m_with_manifold_criterion) { if(m_with_boundary) std::cerr << " (with boundaries)\n"; else std::cerr << " (without boundary)\n"; } else { std::cerr << " (DEACTIVATED)\n"; } #endif } public: // Initialization function void scan_edges() { if(!m_with_manifold_criterion) return; #ifdef CGAL_MESH_3_VERBOSE std::cerr << "\nscanning edges "; if(m_with_boundary) std::cerr << "(boundaries allowed)"; std::cerr << "...\n"; int n = 0; #endif for (typename Tr::Finite_edges_iterator eit = this->r_tr_.finite_edges_begin(), end = this->r_tr_.finite_edges_end(); eit != end; ++eit) { if ( (this->r_c3t3_.face_status(*eit) == C3t3::SINGULAR) || ( (!m_with_boundary) && (this->r_c3t3_.face_status(*eit) == C3t3::BOUNDARY) ) ) { const auto [biggest_f, sq_dist] = biggest_incident_facet_in_complex(*eit); if (is_smaller_than_min_size(sq_dist)) continue; #ifdef CGAL_LINKED_WITH_TBB // Parallel if (std::is_convertible::value) { this->insert_bad_facet(biggest_f, typename Base::Quality()); } else #endif // CGAL_LINKED_WITH_TBB { // Sequential m_bad_edges.insert(Bad_edge(edge_to_edgevv(*eit), (this->r_c3t3_.face_status(*eit) == C3t3::SINGULAR ? 0 : 1))); } #ifdef CGAL_MESH_3_VERBOSE ++n; #endif } } m_manifold_info_initialized = true; #ifdef CGAL_MESH_3_VERBOSE std::cerr << " -> found " << n << " bad edges\n"; #endif } void scan_vertices() { if(!m_with_manifold_criterion) return; CGAL_assertion(m_bad_vertices_initialized == false); CGAL_assertion(m_bad_vertices.empty()); #ifdef CGAL_MESH_3_VERBOSE std::cerr << "\nscanning vertices..." << std::endl; int n = 0; #endif for (typename Tr::Finite_vertices_iterator vit = this->r_tr_.finite_vertices_begin(), end = this->r_tr_.finite_vertices_end(); vit != end; ++vit) { if( this->r_c3t3_.face_status(vit) == C3t3::SINGULAR ) { const auto [biggest_f, sq_dist] = biggest_incident_facet_in_complex(vit); if (is_smaller_than_min_size(sq_dist)) continue; #ifdef CGAL_MESHES_DEBUG_REFINEMENT_POINTS std::cerr << "m_bad_vertices.insert(" << this->r_tr_.point(vit) << ")\n"; #endif // CGAL_MESHES_DEBUG_REFINEMENT_POINTS #ifdef CGAL_LINKED_WITH_TBB // Parallel if (std::is_convertible::value) { this->insert_bad_facet(biggest_f, typename Base::Quality()); } else #endif // CGAL_LINKED_WITH_TBB { // Sequential m_bad_vertices.insert( vit ); } #ifdef CGAL_MESH_3_VERBOSE ++n; #endif } } m_bad_vertices_initialized = true; #ifdef CGAL_MESH_3_VERBOSE std::cerr << " -> found " << n << " bad vertices\n"; # ifdef CGAL_MESHES_DEBUG_REFINEMENT_POINTS std::cerr << "Bad vertices queue:\n"; for(Vertex_handle v2 : m_bad_vertices) { std::cerr << this->r_tr_.point(v2) << std::endl; } CGAL::dump_c3t3(this->r_c3t3_, "dump-at-scan-vertices"); # endif // CGAL_MESHES_DEBUG_REFINEMENT_POINTS #endif } public: void scan_triangulation_impl_amendement() const { #ifdef CGAL_MESH_3_VERBOSE std::cerr << "scanning edges (lazy)" << std::endl; std::cerr << "scanning vertices (lazy)" << std::endl; #endif } // Tells whether there remain elements to refine bool no_longer_element_to_refine_impl() { if(Base::no_longer_element_to_refine_impl()) { if(!m_with_manifold_criterion) return true; #ifndef CGAL_NO_ATOMIC if(this->m_stop_ptr != 0 && this->m_stop_ptr->load(std::memory_order_acquire) == true) { return true; } #endif // not defined CGAL_NO_ATOMIC if(this->m_maximal_number_of_vertices_ !=0 && this->r_tr_.number_of_vertices() >= this->m_maximal_number_of_vertices_) { return true; } // Note: with Parallel_tag, `m_bad_vertices` and `m_bad_edges` // are always empty. return m_bad_edges.left.empty() && m_bad_vertices.empty(); } else // Base::no_longer_element_to_refine_impl() returned false return false; } // Returns the next element to refine Facet get_next_element_impl() { #ifdef CGAL_LINKED_WITH_TBB if (std::is_convertible::value) return Base::get_next_element_impl(); else #endif { //Sequential if (!Base::no_longer_element_to_refine_impl()) { return Base::get_next_element_impl(); } else if(!m_bad_edges.left.empty()) { Edge first_bad_edge = edgevv_to_edge(m_bad_edges.right.begin()->second); #ifdef CGAL_MESHES_DEBUG_REFINEMENT_POINTS const EdgeVV& edgevv = m_bad_edges.right.begin()->second; std::cerr << "Bad edge " << this->r_tr_.point(edgevv.first) << " - " << this->r_tr_.point(edgevv.second) << "\n"; #endif // CGAL_MESHES_DEBUG_REFINEMENT_POINTS return biggest_incident_facet_in_complex(first_bad_edge).first; } else { CGAL_assertion(!m_bad_vertices.empty()); const Vertex_handle& v = *m_bad_vertices.begin(); #ifdef CGAL_MESHES_DEBUG_REFINEMENT_POINTS std::cerr << "Bad vertices queue:\n"; for(Vertex_handle v2 : m_bad_vertices) { std::cerr << this->r_tr_.point(v2) << std::endl; } std::cerr << "Bad vertex " << this->r_tr_.point(v) << "\n"; #endif // CGAL_MESHES_DEBUG_REFINEMENT_POINTS CGAL_assertion(this->r_c3t3_.has_incident_facets_in_complex(v)); if(this->r_c3t3_.face_status(v) != C3t3::SINGULAR) { dump_c3t3(this->r_c3t3_, "dump-crash"); CGAL_error_msg("this->r_c3t3_.face_status(v) != C3t3::SINGULAR"); } return biggest_incident_facet_in_complex(v).first; } } //end Sequential } void before_insertion_impl(const Facet& f, const Weighted_point& s, Zone& zone) { if( m_manifold_info_initialized ) { for (typename Zone::Facets_iterator fit = zone.internal_facets.begin(); fit != zone.internal_facets.end(); ++fit) before_insertion_handle_facet_inside_conflict_zone (*fit); for (typename Zone::Facets_iterator fit = zone.boundary_facets.begin(); fit != zone.boundary_facets.end(); ++fit) before_insertion_handle_facet_on_boundary_of_conflict_zone (*fit); } Base::before_insertion_impl(f, s, zone); } void after_insertion_impl(const Vertex_handle v) { Base::after_insertion_impl(v); if( ! m_manifold_info_initialized ) return; // search for incident facets around v typedef std::vector Facets; Facets facets; facets.reserve(64); this->r_tr_.incident_facets (v, std::back_inserter(facets)); // foreach f in star(v) for (typename Facets::iterator fit = facets.begin(); fit != facets.end(); ++fit) { // foreach edge of *fit const Cell_handle cell = fit->first; const int i = fit->second; for(int j = 0; j < 3; ++j) { const int edge_index_va = this->r_tr_.vertex_triple_index(i, j); const int edge_index_vb = this->r_tr_.vertex_triple_index(i, (j == 2) ? 0 : (j+1)); Edge edge(cell, edge_index_va, edge_index_vb); // test if edge is in Complex if ( this->r_c3t3_.face_status(edge) != C3t3::NOT_IN_COMPLEX ) { // test if edge is not regular to store it as a "bad_edge" // e.g. more than or equal to 3 incident facets (SINGULAR) // or less than or equal to 1 // (BOUNDARY only, because ISOLATED is NA) // This test is not efficient because // edges are tried to be inserted several times // TODO one day: test if the edge is still singular if ( (this->r_c3t3_.face_status(edge) == C3t3::SINGULAR) || ( (!m_with_boundary) && (this->r_c3t3_.face_status(edge) == C3t3::BOUNDARY) ) ) { const auto [biggest_f, sq_dist] = biggest_incident_facet_in_complex(edge); if (is_smaller_than_min_size(sq_dist)) continue; #ifdef CGAL_LINKED_WITH_TBB // Parallel if (std::is_convertible::value) { this->insert_bad_facet(biggest_f, typename Base::Quality()); } else #endif // CGAL_LINKED_WITH_TBB { // Sequential m_bad_edges.insert(Bad_edge(edge_to_edgevv(edge), (this->r_c3t3_.face_status(edge) == C3t3::SINGULAR ? 0 : 1))); } } else { #ifdef CGAL_LINKED_WITH_TBB // Sequential only if (!std::is_convertible::value) #endif // CGAL_LINKED_WITH_TBB { m_bad_edges.left.erase( edge_to_edgevv(edge) ); // @TODO: pourquoi?! } } } } } if(!m_bad_vertices_initialized) return; // foreach v' in star of v std::vector vertices; vertices.reserve(64); this->r_tr_.incident_vertices(v, std::back_inserter(vertices)); // is_regular_or_boundary_for_vertices // is used here also incident edges are not known to be // REGULAR which may cause some singular vertices to be forgotten // This causes no problem because // those SINGULAR incident SINGULAR edges are going to be handled for (typename std::vector::iterator vit = vertices.begin(), end = vertices.end(); vit != end; ++vit) { if ( this->r_c3t3_.has_incident_facets_in_complex(*vit) && (this->r_c3t3_.face_status(*vit) == C3t3::SINGULAR) // !this->r_c3t3_.is_regular_or_boundary_for_vertices(*vit) ) { const auto [biggest_f, sq_dist] = biggest_incident_facet_in_complex(*vit); if (is_smaller_than_min_size(sq_dist)) continue; #ifdef CGAL_MESHES_DEBUG_REFINEMENT_POINTS std::cerr << "m_bad_vertices.insert(" << this->r_tr_.point(*vit) << ")\n"; #endif // CGAL_MESHES_DEBUG_REFINEMENT_POINTS #ifdef CGAL_LINKED_WITH_TBB // Parallel if (std::is_convertible::value) { this->insert_bad_facet(biggest_f, typename Base::Quality()); } else #endif // CGAL_LINKED_WITH_TBB { // Sequential m_bad_vertices.insert(*vit); } } } if ( this->r_c3t3_.has_incident_facets_in_complex(v) && (this->r_c3t3_.face_status(v) == C3t3::SINGULAR) // !this->r_c3t3_.is_regular_or_boundary_for_vertices(v) ) { const auto [biggest_f, sq_dist] = biggest_incident_facet_in_complex(v); if (is_smaller_than_min_size(sq_dist)) return; #ifdef CGAL_MESHES_DEBUG_REFINEMENT_POINTS std::cerr << "m_bad_vertices.insert(" << this->r_tr_.point(v) << ")\n"; #endif // CGAL_MESHES_DEBUG_REFINEMENT_POINTS #ifdef CGAL_LINKED_WITH_TBB // Parallel if (std::is_convertible::value) { this->insert_bad_facet(biggest_f, typename Base::Quality()); } else #endif // CGAL_LINKED_WITH_TBB { // Sequential m_bad_vertices.insert(v); } } } /// debug info: class name std::string debug_info_class_name_impl() const { return "Refine_facets_manifold_base"; } std::string debug_info() const { std::stringstream s; s << Base::debug_info(); if(m_with_manifold_criterion) { s << "," << m_bad_edges.left.size() << "," << m_bad_vertices.size(); } return s.str(); } std::string debug_info_header() const { std::stringstream s; s << Base::debug_info_header(); if(m_with_manifold_criterion) { s << ",#bad edges,#bad vertices"; } return s.str(); } }; // end Refine_facets_manifold_base } // end namespace Mesh_3 } // end namespace CGAL #include #endif // CGAL_MESH_3_REFINE_FACETS_MANIFOLD_BASE_H