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) 2002,2011 Utrecht University (The Netherlands). // All rights reserved. // // This file is part of CGAL (www.cgal.org). // // $URL: https://github.com/CGAL/cgal/blob/v6.1/Spatial_searching/include/CGAL/Point_container.h $ // $Id: include/CGAL/Point_container.h b26b07a1242 $ // SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial // // // Author(s) : Hans Tangelder () // custom point container #ifndef CGAL_POINT_CONTAINER_H #define CGAL_POINT_CONTAINER_H #include #include #include #include #include #include #include #include namespace CGAL { template class Point_container { private: typedef typename Traits::Point_d Point_d; typedef std::vector Point_vector; public: typedef typename Traits::FT FT; typedef typename Point_vector::iterator iterator; typedef typename Point_vector::const_iterator const_iterator; typedef typename internal::Get_dimension_tag::Dimension D; private: Traits traits; // the iterator range of the Point_container std::optional m_b ; std::optional m_e ; int built_coord; // a coordinate for which the pointer list is built Kd_tree_rectangle bbox; // bounding box, i.e. rectangle of node Kd_tree_rectangle tbox; // tight bounding box, // i.e. minimal enclosing bounding // box of points public: inline const Kd_tree_rectangle& bounding_box() const { return bbox; } inline const Kd_tree_rectangle& tight_bounding_box() const { return tbox; } inline int dimension() const { return bbox.dimension(); } inline int built_coordinate() const { return built_coord; } // coordinate of the maximal span inline int max_span_coord() const { return bbox.max_span_coord(); } // coordinate of the maximal tight span inline int max_tight_span_coord() const { return tbox.max_span_coord(); } inline FT max_span_lower() const { return bbox.min_coord(max_span_coord()); } inline FT max_tight_span_lower() const { return tbox.min_coord(max_tight_span_coord()); } inline FT max_span_upper() const { return bbox.max_coord(max_span_coord()); } inline FT max_tight_span_upper() const { return tbox.max_coord(max_tight_span_coord()); } inline FT max_spread() const { return max_span_upper() - max_span_lower(); } inline FT max_tight_spread() const { return max_tight_span_upper() - max_tight_span_lower(); } int max_tight_span_coord_balanced(FT Aspect_ratio) const { int cut_dim(-1); FT max_spread_points(FT(-1)); FT max_length = max_spread(); // length of longest side of box int dim = dimension(); for (int d=0; d max_spread_points) { max_spread_points = spread; cut_dim = d; } } } // CGAL_assertion(cut_dim >= 0); return cut_dim; } FT max_span_upper_without_dim(int d) const { FT max_span(FT(0)); int dim=dimension(); for (int i=0; i max_span) max_span=span; } return max_span; } FT balanced_fair(int d, FT Aspect_ratio) { FT small_piece = max_span_upper_without_dim(d) / Aspect_ratio; FT low_cut = bbox.min_coord(d) + small_piece; // lowest legal cut; FT high_cut = bbox.max_coord(d) - small_piece; //highest legal cut; // CGAL_assertion (high_cut >= low_cut); FT split_value = median(d); if (split_value < low_cut) split_value = low_cut; if (split_value > high_cut) split_value = high_cut; return split_value; } FT balanced_sliding_fair(int d, FT Aspect_ratio) { FT small_piece = max_span_upper_without_dim(d) / Aspect_ratio; FT low_cut = bbox.min_coord(d) + small_piece; // lowest legal cut; FT high_cut = bbox.max_coord(d) - small_piece; //highest legal cut; // CGAL_assertion (high_cut >= low_cut); FT split_value = median(d); FT max_span_lower = tbox.min_coord(d); FT max_span_upper = tbox.max_coord(d); if (split_value < low_cut) split_value= max_span_lower; if (split_value > high_cut) split_value = max_span_upper; return split_value; } // points inline std::size_t size() const { return *m_e - *m_b; } inline const_iterator begin() const { return *m_b; } inline const_iterator end() const { return *m_e; } inline iterator begin() { return *m_b; } inline iterator end() { return *m_e; } inline bool empty() const { return !m_b || !m_e || (*m_b == *m_e ) ; } // building the container from a sequence of Point_d* Point_container(const int d, iterator begin, iterator end,const Traits& traits_) : traits(traits_),m_b(begin), m_e(end), bbox(d, begin, end,traits.construct_cartesian_const_iterator_d_object()), tbox(d) { tbox = bbox; built_coord = max_span_coord(); } void set_range(iterator begin, iterator end) { m_b = begin; m_e = end; } // building an empty container Point_container(const int d,const Traits& traits_) : traits(traits_),bbox(d), tbox(d) {} template struct Cmp { typedef typename Traits2::FT FT; typedef typename Traits2::Point_d Point_d; typedef std::vector Point_vector; int split_coord; FT value; const typename Traits2::Construct_cartesian_const_iterator_d& construct_it; Cmp(int s, FT c,const typename Traits2::Construct_cartesian_const_iterator_d& cst_it) : split_coord(s), value(c), construct_it(cst_it) {} bool operator()(const Point_d* pt) const { typename Traits2::Cartesian_const_iterator_d ptit; ptit = construct_it(*pt); return *(ptit+split_coord) < value; } }; template struct Between { typedef typename Traits2::FT FT; typedef typename Traits2::Point_d Point_d; typedef std::vector Point_vector; int split_coord; FT low, high; const typename Traits2::Construct_cartesian_const_iterator_d& construct_it; Between(int s, FT l, FT h,const typename Traits2::Construct_cartesian_const_iterator_d& cst_it) : split_coord(s), low(l), high(h), construct_it(cst_it) {} bool operator()(const Point_d* pt) const { typename Traits2::Cartesian_const_iterator_d ptit; ptit = construct_it(*pt); if(! ( *(ptit+split_coord) <= high ) ){ // std::cerr << "Point " << *pt << " exceeds " << high << " in dimension " << split_coord << std::endl; return false; } if(! ( *(ptit+split_coord) >= low ) ){ //std::cerr << "Point " << *pt << " below " << low << " in dimension " << split_coord << std::endl; return false; } return true; } }; void recompute_tight_bounding_box() { tbox.template update_from_point_pointers(begin(), end(),traits.construct_cartesian_const_iterator_d_object()); } bool is_valid() const { if(empty()) return true; bool b = true; for (int i = 0; i < dimension(); i++){ CGAL_assertion( b = (b && (bbox.min_coord(i) <= tbox.min_coord(i)))); CGAL_assertion( b = (b && (bbox.max_coord(i) >= tbox.max_coord(i)))); typename Traits::Construct_cartesian_const_iterator_d construct_it=traits.construct_cartesian_const_iterator_d_object(); Between between(i,tbox.min_coord(i), tbox.max_coord(i), construct_it); for(const_iterator it = begin(); it != end(); it++){ b = (b && between(*it)); } } return b; } // note that splitting is restricted to the built coordinate template void split(Point_container& c, Separator& sep, bool sliding=false) { CGAL_assertion(dimension()==c.dimension()); CGAL_assertion(is_valid()); c.bbox=bbox; const int split_coord = sep.cutting_dimension(); FT cutting_value = sep.cutting_value(); built_coord=split_coord; c.built_coord=split_coord; typename Traits::Construct_cartesian_const_iterator_d construct_it=traits.construct_cartesian_const_iterator_d_object(); Cmp cmp(split_coord, cutting_value,construct_it); iterator it = std::partition(begin(), end(), cmp); // now [begin,it) are lower and [it,end) are upper if (sliding) { // avoid empty lists if (it == begin()) { iterator minelt = std::min_element(begin(),end(),comp_coord_val(split_coord,construct_it)); if(minelt != it){ std::iter_swap(minelt,it); } cutting_value = *(construct_it(**it)+split_coord); sep.set_cutting_value(cutting_value); it++; } if (it == end()) { iterator maxelt = std::max_element(begin(),end(),comp_coord_val(split_coord,construct_it)); it--; if(maxelt != it){ std::iter_swap(maxelt,it); } cutting_value = *(construct_it(**it)+split_coord); sep.set_cutting_value(cutting_value); } } c.set_range(begin(), it); set_range(it, end()); // adjusting boxes bbox.set_lower_bound(split_coord, cutting_value); tbox. template update_from_point_pointers(begin(),end(),construct_it); c.bbox.set_upper_bound(split_coord, cutting_value); c.tbox. template update_from_point_pointers(c.begin(),c.end(),construct_it); CGAL_assertion(is_valid()); CGAL_assertion(c.is_valid()); } template struct comp_coord_val { private: Value coord; const typename Traits2::Construct_cartesian_const_iterator_d& construct_it; typedef typename Traits2::Point_d Point_d; public: comp_coord_val (const Value& coordinate,const typename Traits2::Construct_cartesian_const_iterator_d& cst_it) : coord(coordinate), construct_it(cst_it) {} bool operator()(const Point_d *a, const Point_d *b) const { typename Traits2::Cartesian_const_iterator_d ait = construct_it(*a), bit = construct_it(*b); return *(ait+coord) < *(bit+coord); } }; FT median(const int split_coord) { typename Traits::Construct_cartesian_const_iterator_d construct_it=traits.construct_cartesian_const_iterator_d_object(); iterator mid = begin() + (end() - begin())/2; std::nth_element(begin(), mid, end(),comp_coord_val(split_coord,construct_it)); typename Traits::Cartesian_const_iterator_d mpit = construct_it((*(*mid))); FT val1 = *(mpit+split_coord); // Avoid using the low coord value as it results in an empty split if (val1 == tbox.min_coord(split_coord)) { iterator it = std::min_element(mid, end(), [=](const Point_d* a, const Point_d* b) -> bool { FT a_c = *(construct_it(*a) + split_coord); FT b_c = *(construct_it(*b) + split_coord); if (a_c == val1) return false; if (b_c == val1) return true; return a_c < b_c; }); return *(construct_it(**it) + split_coord); } mid++; if (mid == end()) return val1; mpit = construct_it((*(*mid))); FT val2 = *(mpit+split_coord); return (val1+val2)/FT(2); } private: explicit Point_container() {} // disable default constructor }; template std::ostream& operator<< (std::ostream& s, Point_container& c) { s << "Points container of size " << c.size() << "\n cell:"; s << c.bounding_box(); s << "\n minimal box enclosing points:"; s << c.tight_bounding_box(); return s; } } // namespace CGAL #endif // CGAL_POINT_CONTAINER_H