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) 2004-2005 INRIA Sophia-Antipolis (France). // All rights reserved. // // This file is part of CGAL (www.cgal.org). // // $URL: https://github.com/CGAL/cgal/blob/v6.1/Mesh_2/include/CGAL/Mesh_2/Refine_edges_with_clusters.h $ // $Id: include/CGAL/Mesh_2/Refine_edges_with_clusters.h b26b07a1242 $ // SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial // // // Author(s) : Laurent RINEAU #ifndef CGAL_MESH_2_REFINE_EDGES_WITH_CLUSTERS_H #define CGAL_MESH_2_REFINE_EDGES_WITH_CLUSTERS_H #include #include #include #include #include namespace CGAL { namespace Mesh_2 { /** * This class is the base for the first level of Mesh_2: the edge * conforming level. It \e does handle clusters. * To handle clusters, an helping `Clusters` object is used. * * \param Tr is the type of triangulation on which the level acts. * \param Is_locally_conform defines the locally conform criterion: Gabriel * or Delaunay. It defaults to the Garbriel criterion. * \param Container is the type of container. It defaults to a filtered * queue of `Vertex_handle` pair (see `Filtered_queue_container`). */ template < class Tr, class Is_locally_conform = Is_locally_conforming_Gabriel, class Container = typename details::Refine_edges_base_types::Default_container > class Refine_edges_base_with_clusters : public Refine_edges_base { typedef Refine_edges_base Super; typedef typename Tr::Vertex_handle Vertex_handle; typedef typename Tr::Face_handle Face_handle; typedef typename Tr::Edge Edge; typedef typename Tr::Point Point; typedef typename Tr::Geom_traits Geom_traits; typedef typename Geom_traits::FT FT; typedef typename Tr::Finite_edges_iterator Finite_edges_iterator; typedef typename Tr::Face_circulator Face_circulator; typedef typename Triangulation_mesher_level_traits_2::Zone Zone; typedef typename Clusters::Cluster Cluster; typedef typename Clusters::iterator clusters_iterator; /* --- private data --- */ Clusters& clusters; bool va_has_a_cluster, vb_has_a_cluster; mutable bool cluster_splitted; Cluster ca, cb; clusters_iterator ca_it, cb_it; public: using Super::triangulation_ref_impl; /** \name CONSTRUCTORS */ Refine_edges_base_with_clusters(Tr& tr_, Clusters& c_) : Super(tr_), clusters(c_) { } /** \name FUNCTIONS NEEDED BY Mesher_level OVERRIDDEN BY THIS CLASS. */ Point refinement_point_impl(const Edge& edge) { typename Geom_traits::Construct_midpoint_2 midpoint = this->triangulation_ref_impl().geom_traits().construct_midpoint_2_object(); this->va = edge.first->vertex(Tr::cw (edge.second)); this->vb = edge.first->vertex(Tr::ccw(edge.second)); #ifdef CGAL_MESH_2_DEBUG_REFINEMENT_POINTS std::cerr << "refinement_point_impl(" << "#" << this->va->time_stamp() << ": " << this->va->point() << ", " << "#" << this->vb->time_stamp() << ": " << this->vb->point() << ") = "; #endif // CGAL_MESH_2_DEBUG_BAD_FACES // std::cerr << "refinement_point_impl\n" << this->va->point() << " / " // << this->vb->point() << std::endl; va_has_a_cluster = false; vb_has_a_cluster = false; cluster_splitted = false; // true below to remove ca and cb because they will // be restored by update_cluster(...). if( clusters.get_cluster(this->va,this->vb,ca,ca_it) ) { if( clusters.get_cluster(this->vb,this->va,cb,cb_it) ) { // both ends are clusters va_has_a_cluster = true; vb_has_a_cluster = true; #ifdef CGAL_MESH_2_DEBUG_CLUSTERS std::cerr << "midpoint(" << this->va->point() << " , " << this->vb->point() << ")\n"; #endif // CGAL_MESH_2_DEBUG_CLUSTERS #ifdef CGAL_MESH_2_DEBUG_REFINEMENT_POINTS auto p = midpoint(this->va->point(), this->vb->point()); std::cerr << p << '\n'; return p; #endif // CGAL_MESH_2_DEBUG_BAD_FACES return midpoint(this->va->point(), this->vb->point()); } else { // va only is a cluster va_has_a_cluster = true; #ifdef CGAL_MESH_2_DEBUG_REFINEMENT_POINTS auto p = split_cluster_point(this->va,this->vb,ca); std::cerr << p << '\n'; return p; #endif // CGAL_MESH_2_DEBUG_BAD_FACES return split_cluster_point(this->va,this->vb,ca); } } else if( clusters.get_cluster(this->vb,this->va,cb,cb_it) ){ // vb only is a cluster vb_has_a_cluster = true; #ifdef CGAL_MESH_2_DEBUG_REFINEMENT_POINTS auto p = split_cluster_point(this->vb,this->va,cb); std::cerr << p << '\n'; return p; #endif // CGAL_MESH_2_DEBUG_BAD_FACES return split_cluster_point(this->vb,this->va,cb); }else{ // no cluster #ifdef CGAL_MESH_2_DEBUG_CLUSTERS std::cerr << "midpoint(" << this->va->point() << " , " << this->vb->point() << ")\n"; #endif // CGAL_MESH_2_DEBUG_CLUSTERS #ifdef CGAL_MESH_2_DEBUG_REFINEMENT_POINTS auto p = midpoint(this->va->point(), this->vb->point()); std::cerr << p << '\n'; return p; #endif // CGAL_MESH_2_DEBUG_BAD_FACES return midpoint(this->va->point(), this->vb->point()); } }; void after_insertion_impl(const Vertex_handle& v) { #ifdef CGAL_MESH_2_DEBUG_CLUSTERS std::cerr << "update_clusters" << std::endl; std::cerr << "va_has_a_cluster=" << va_has_a_cluster << std::endl << "vb_has_a_cluster=" << vb_has_a_cluster << std::endl; std::cerr << "clusters.size()=" << clusters.size() << std::endl; #endif // CGAL_MESH_2_DEBUG_CLUSTERS Super::after_insertion_impl(v); if( va_has_a_cluster ) clusters.update_cluster(ca,ca_it,this->va,this->vb,v,cluster_splitted); if( vb_has_a_cluster ) clusters.update_cluster(cb,cb_it,this->vb,this->va,v,cluster_splitted); #ifdef CGAL_MESH_2_DEBUG_CLUSTERS std::cerr << "clusters.size() after update_cluster=" << clusters.size() << std::endl; #endif // CGAL_MESH_2_DEBUG_CLUSTERS } /** * Test if the edges of the boundary are locally conforming. * Push which that are not in the list of edges to be conformed. */ Mesher_level_conflict_status test_point_conflict_from_superior_impl(const Point& p, Zone& z) { Mesher_level_conflict_status status = NO_CONFLICT; // p is the circumcener of zone.parent_face. const FT& sq_r_of_p_parent = shortest_edge_squared_length(z.parent_face); for(typename Zone::Edges_iterator eit = z.boundary_edges.begin(); eit != z.boundary_edges.end(); ++eit) { const Face_handle& fh = eit->first; const int& i = eit->second; if(fh->is_constrained(i) && !this->is_locally_conform(this->tr, fh, i, p)) { const Vertex_handle& v1 = fh->vertex( this->tr.cw (i)); const Vertex_handle& v2 = fh->vertex( this->tr.ccw(i)); status = CONFLICT_BUT_ELEMENT_CAN_BE_RECONSIDERED; bool v1_has_a_cluster = clusters.get_cluster(v1,v2,ca,ca_it); bool v2_has_a_cluster = clusters.get_cluster(v2,v1,cb,cb_it); if( ( v1_has_a_cluster && v2_has_a_cluster) || (!v1_has_a_cluster && !v2_has_a_cluster) ) { // two clusters or no cluster this->add_constrained_edge_to_be_conformed(v1, v2); // status = CONF//CONFLICT_AND_ELEMENT_SHOULD_BE_DROPPED; } else { // only one cluster: c or c2 if(v2_has_a_cluster) ca = cb; // What Shewchuk says: // - If the cluster is not reduced (all segments don't have the same // length as [v1,v2]), then split the edge // - Else, let rmin be the minimum insertion radius introduced by the // potential split, let T be the triangle whose circumcenter // encroaches [v1,v2] and let rg be the length of the shortest edge // of T. If rmin >= rg, then split the edge. if( this->imperatively || !ca.is_reduced() || ca.rmin >= sq_r_of_p_parent) this->add_constrained_edge_to_be_conformed(v1,v2); else status = CONFLICT_AND_ELEMENT_SHOULD_BE_DROPPED; } } } // after here edges encroached by p are in the list of edges to // be conformed. return status; } private: /** \name Auxiliary functions to handle clusters. */ FT shortest_edge_squared_length(Face_handle f) { typename Geom_traits::Compute_squared_distance_2 squared_distance = this->tr.geom_traits().compute_squared_distance_2_object(); const Point& pa = (f->vertex(0))->point(); const Point& pb = (f->vertex(1))->point(); const Point& pc = (f->vertex(2))->point(); FT a, b, c; a = squared_distance(pb, pc); b = squared_distance(pc, pa); c = squared_distance(pa, pb); return ((CGAL::min)(a, (CGAL::min)(b, c))); } Point split_cluster_point(Vertex_handle va, Vertex_handle vb, const Cluster& c) const { typename Geom_traits::Construct_vector_2 vector = this->tr.geom_traits().construct_vector_2_object(); typename Geom_traits::Construct_scaled_vector_2 scaled_vector = this->tr.geom_traits().construct_scaled_vector_2_object(); typename Geom_traits::Compute_squared_distance_2 squared_distance = this->tr.geom_traits().compute_squared_distance_2_object(); typename Geom_traits::Construct_midpoint_2 midpoint = this->tr.geom_traits().construct_midpoint_2_object(); typename Geom_traits::Construct_translated_point_2 translate = this->tr.geom_traits().construct_translated_point_2_object(); typedef typename Geom_traits::FT FT; cluster_splitted = true; const Point& a = va->point(); const Point& b = vb->point(); #ifdef CGAL_MESH_2_DEBUG_CLUSTERS std::cerr << "split_cluster_point(" << va->point() << " , " << vb->point() << ")\n" << " reduced: " << c.is_reduced() << "\nresult: "; #endif // CGAL_MESH_2_DEBUG_CLUSTERS if( c.is_reduced() ) { #ifdef CGAL_MESH_2_DEBUG_CLUSTERS std::cerr << midpoint(a, b) << " (midpoint)\n"; #endif // CGAL_MESH_2_DEBUG_CLUSTERS return midpoint(a, b); } else { const Point m = midpoint(a, b); typename Geom_traits::Vector_2 v = vector(a,m); v = scaled_vector( v, CGAL_NTS sqrt(CGAL_NTS to_double(c.minimum_squared_length / squared_distance(a, b)))); Point i = translate(a,v), i2(i); do { i = translate(a,v); v = scaled_vector(v,FT(2)); i2 = translate(a,v); } while(squared_distance(a,i2) <= squared_distance(a,m)); if( squared_distance(i,m) > squared_distance(m,i2) ) i = i2; //here i is the best point for splitting #ifdef CGAL_MESH_2_DEBUG_CLUSTERS std::cerr << i << std::endl; #endif // CGAL_MESH_2_DEBUG_CLUSTERS return i; } } protected: }; // end class Refine_edges_base_with_clusters template < typename Tr, typename Is_locally_conform = Is_locally_conforming_Gabriel, typename Base = Refine_edges_base_with_clusters > struct Refine_edges_with_clusters : public Base, public details::Refine_edges_types >::Edges_mesher_level { typedef Refine_edges_with_clusters Self; typedef typename details::Refine_edges_types::Edges_mesher_level Mesher; public: Refine_edges_with_clusters(Tr& t, Clusters& c, Null_mesher_level& null_level) : Base(t, c), Mesher(null_level) { } }; // end Refine_edges_with_clusters } // end namespace Mesh_2 } // end namespace CGAL #endif // CGAL_MESH_2_REFINE_EDGES_WITH_CLUSTERS_H