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 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/Interpolation/include/CGAL/surface_neighbors_3.h $ // $Id: include/CGAL/surface_neighbors_3.h b26b07a1242 $ // SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial // // Author(s) : Julia Floetotto #ifndef CGAL_SURFACE_NEIGHBORS_3_H #define CGAL_SURFACE_NEIGHBORS_3_H #include #include #include #include //contains the definition of the Comparator "closer_to_point" and // the function object Project_vertex_iterator_to_point #include #include #include #include namespace CGAL { //without Delaunay filtering template inline OutputIterator surface_neighbors_3(InputIterator first, InputIterator beyond, const typename Kernel::Point_3& p, const typename Kernel::Vector_3& normal, OutputIterator out, const Kernel&) { typedef Voronoi_intersection_2_traits_3 I_gt; return surface_neighbors_3(first, beyond, p, out, I_gt(p,normal)); } template OutputIterator surface_neighbors_3(InputIterator first, InputIterator beyond, const typename ITraits::Point_2& p, OutputIterator out, const ITraits& traits) { //definition of the Voronoi intersection triangulation: typedef Regular_triangulation_2< ITraits> I_triangulation; typedef typename I_triangulation::Vertex_handle Vertex_handle; typedef typename I_triangulation::Face_handle Face_handle; typedef typename I_triangulation::Locate_type Locate_type; //build Voronoi intersection triangulation: I_triangulation it(traits); typename ITraits::Construct_weighted_point_2 p2wp = it.geom_traits().construct_weighted_point_2_object(); typename ITraits::Construct_point_2 wp2p = it.geom_traits().construct_point_2_object(); while(first != beyond){ it.insert(p2wp(*first++)); } const typename ITraits::Weighted_point_2 wp = p2wp(p); Locate_type lt; int li; Face_handle fh = it.locate(wp, lt, li); if(lt == I_triangulation::VERTEX){ *out++ = p; return out; } Vertex_handle vh = it.insert(wp, fh); typename I_triangulation::Vertex_circulator vc(it.incident_vertices(vh)), done(vc); do{ *out++= wp2p(vc->point()); CGAL_assertion(! it.is_infinite(vc)); } while(vc++ != done); return out; } //without Delaunay filtering -- certified version: // a boolean is returned that indicates if a sufficiently large // neighborhood has been considered so that the // Voronoi cell of p is not affected by any point outside the smallest // ball centered on p containing all points in [first,beyond) template std::pair< OutputIterator, bool > surface_neighbors_certified_3(InputIterator first, InputIterator beyond, const typename Kernel::Point_3& p, const typename Kernel::Vector_3& normal, OutputIterator out, const Kernel&) { typedef Voronoi_intersection_2_traits_3 I_gt; return surface_neighbors_certified_3(first, beyond, p, out, I_gt(p,normal)); } //this function takes the radius of the sphere centered on p // containing the points in [first, beyond] (i.e. the maximal // distance from p to [first,beyond) as add. parameter: template std::pair< OutputIterator, bool > surface_neighbors_certified_3(InputIterator first, InputIterator beyond, const typename Kernel::Point_3& p, const typename Kernel::Vector_3& normal, const typename Kernel::FT& radius, OutputIterator out, const Kernel& /*K*/) { typedef Voronoi_intersection_2_traits_3 I_gt; return surface_neighbors_certified_3(first, beyond, p, radius, out, I_gt(p,normal)); } // Versions with instantiated traits class: template std::pair< OutputIterator, bool > surface_neighbors_certified_3(InputIterator first, InputIterator beyond, const typename ITraits::Point_2& p, OutputIterator out, const ITraits& traits) { //find the point in [first,beyond) furthest from p: InputIterator furthest = std::max_element(first, beyond, closer_to_point(p, traits)); return surface_neighbors_certified_3 (first, beyond, p, traits.compute_squared_distance_2_object()(p,*furthest), out, traits); } template std::pair< OutputIterator, bool > surface_neighbors_certified_3(InputIterator first, InputIterator beyond, const typename ITraits::Point_2& p, const typename ITraits::FT& radius, OutputIterator out, const ITraits& traits) { //definition of the Voronoi intersection triangulation: typedef Regular_triangulation_2< ITraits> I_triangulation; typedef typename I_triangulation::Vertex_handle Vertex_handle; typedef typename I_triangulation::Face_handle Face_handle; typedef typename I_triangulation::Vertex_circulator Vertex_circulator; typedef typename I_triangulation::Face_circulator Face_circulator; typedef typename I_triangulation::Locate_type Locate_type; //build Voronoi intersection triangulation: I_triangulation it(traits); typename ITraits::Construct_weighted_point_2 p2wp = it.geom_traits().construct_weighted_point_2_object(); typename ITraits::Construct_point_2 wp2p = it.geom_traits().construct_point_2_object(); while(first != beyond){ it.insert(p2wp(*first++)); } const typename ITraits::Weighted_point_2 wp = p2wp(p); Locate_type lt; int li; Face_handle fh = it.locate(wp, lt, li); if(lt == I_triangulation::VERTEX){ *out++ = p; return std::make_pair(out,true); } Vertex_handle vh = it.insert(wp, fh); CGAL_assertion(vh->is_valid()); //determine the furthest distance from p to a vertex of its cell bool valid(false); Face_circulator fc(it.incident_faces(vh)), fdone(fc); do{ valid = (!it.is_infinite(fc) && (4*radius > traits.compute_squared_distance_2_object() (p, it.dual(fc)))); }while(!valid && ++fc!=fdone); //get the neighbor points: Vertex_circulator vc(it.incident_vertices(vh)), vdone(vc); do{ *out++ = wp2p(vc->point()); }while(++vc!=vdone); return std::make_pair(out, valid); } //using Delaunay triangulation for candidate point filtering: // => no certification is necessary template inline OutputIterator surface_neighbors_3(const Dt& dt, const typename Dt::Geom_traits::Point_3& p, const typename Dt::Geom_traits::Vector_3& normal, OutputIterator out, typename Dt::Cell_handle start =typename Dt::Cell_handle()) { typedef Voronoi_intersection_2_traits_3 I_gt; return surface_neighbors_3(dt, p, out, I_gt(p,normal),start); } template OutputIterator surface_neighbors_3(const Dt& dt, const typename ITraits::Point_2& p, OutputIterator out, const ITraits& traits, typename Dt::Cell_handle start = typename Dt::Cell_handle()) { typedef typename ITraits::Point_2 Point_3; typedef typename Dt::Cell_handle Cell_handle; typedef typename Dt::Vertex_handle Vertex_handle; typedef typename Dt::Locate_type Locate_type; //the Vertex_handle is, in fact, an iterator over vertex: typedef Project_vertex_iterator_to_point< Vertex_handle> Proj_point; typedef Iterator_project::iterator, Proj_point, const Point_3&, const Point_3*, std::ptrdiff_t, std::forward_iterator_tag> Point_iterator; Locate_type lt; int li, lj ; Cell_handle c = dt.locate(p, lt, li,lj,start); //if p is located on a vertex: the only neighbor is found if(lt == Dt::VERTEX){ *out++= (c->vertex(li))->point(); return out; } //otherwise get vertices in conflict typename std::list< Vertex_handle > conflict_vertices; dt.vertices_on_conflict_zone_boundary(p,c, std::back_inserter(conflict_vertices)); for (typename std::list< Vertex_handle >::iterator it = conflict_vertices.begin(); it != conflict_vertices.end();){ if(dt.is_infinite(*it)){ typename std::list< Vertex_handle >::iterator itp = it; it++; conflict_vertices.erase(itp); } else { it++; } } return surface_neighbors_3(Point_iterator(conflict_vertices.begin()), Point_iterator(conflict_vertices.end()), p, out, traits); } } //namespace CGAL #endif // CGAL_SURFACE_NEIGHBORS_3_H