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) 2005,2006,2007,2008,2009,2010,2011 Tel-Aviv University (Israel). // All rights reserved. // // This file is part of CGAL (www.cgal.org). // // $URL: https://github.com/CGAL/cgal/blob/v6.1/Arrangement_on_surface_2/include/CGAL/Arr_overlay_2.h $ // $Id: include/CGAL/Arr_overlay_2.h b26b07a1242 $ // SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial // // // Author(s) : Baruch Zukerman // Efi Fogel #ifndef CGAL_ARR_OVERLAY_2_H #define CGAL_ARR_OVERLAY_2_H #include #include /*! \file * * Definition of the global Arr_overlay_2() function. */ #include #include #include #include #include #include #include #include #include #include #include #include namespace CGAL { template class Indexed_sweep_accessor { const Arr1& arr1; const Arr2& arr2; mutable std::vector backup_inc; public: Indexed_sweep_accessor (const Arr1& arr1, const Arr2& arr2) : arr1(arr1), arr2(arr2) { } std::size_t nb_vertices() const { return arr1.number_of_vertices() + arr2.number_of_vertices(); } std::size_t min_end_index (const Curve& c) const { if (c.red_halfedge_handle() != typename Curve::HH_red()) return reinterpret_cast(c.red_halfedge_handle()->target()->inc()); // else CGAL_assertion (c.blue_halfedge_handle() != typename Curve::HH_blue()); return reinterpret_cast(c.blue_halfedge_handle()->target()->inc()); } std::size_t max_end_index (const Curve& c) const { if (c.red_halfedge_handle() != typename Curve::HH_red()) return reinterpret_cast(c.red_halfedge_handle()->source()->inc()); // else CGAL_assertion (c.blue_halfedge_handle() != typename Curve::HH_blue()); return reinterpret_cast(c.blue_halfedge_handle()->source()->inc()); } const Curve& curve (const Curve& c) const { return c; } // Initializes indices by squatting Vertex::inc(); void before_init() const { std::size_t idx = 0; backup_inc.resize (nb_vertices()); for (typename Arr1::Vertex_const_iterator vit = arr1.vertices_begin(); vit != arr1.vertices_end(); ++vit, ++idx) { CGAL_assertion (idx < backup_inc.size()); backup_inc[idx] = vit->inc(); vit->set_inc (reinterpret_cast(idx)); } for (typename Arr2::Vertex_const_iterator vit = arr2.vertices_begin(); vit != arr2.vertices_end(); ++vit, ++idx) { CGAL_assertion (idx < backup_inc.size()); backup_inc[idx] = vit->inc(); vit->set_inc (reinterpret_cast(idx)); } } // Restores state of arrangements before index squatting void after_init() const { std::size_t idx = 0; for (typename Arr1::Vertex_const_iterator vit = arr1.vertices_begin(); vit != arr1.vertices_end(); ++vit, ++idx) { CGAL_assertion (idx < backup_inc.size()); vit->set_inc (backup_inc[idx]); } for (typename Arr2::Vertex_const_iterator vit = arr2.vertices_begin(); vit != arr2.vertices_end(); ++vit, ++idx) { CGAL_assertion (idx < backup_inc.size()); vit->set_inc (backup_inc[idx]); } } private: }; /*! Compute the overlay of two input arrangements. * \tparam GeometryTraitsA_2 the geometry traits of the first arrangement. * \tparam GeometryTraitsB_2 the geometry traits of the second arrangement. * \tparam GeometryTraitsRes_2 the geometry traits of the resulting arrangement. * \tparam TopologyTraitsA the topology traits of the first arrangement. * \tparam TopologyTraitsB the topology traits of the second arrangement. * \tparam TopologyTraitsRes the topology traits of the resulting arrangement. * \tparam OverlayTraits An overlay-traits class. As arr1, arr2 and res can be * templated with different geometry-traits class and * different DCELs (encapsulated in the various topology-traits * classes). The geometry-traits of the result arrangement is * used to construct the result arrangement. This means that all * the types (e.g., Point_2, Curve_2 and X_monotone_2) of both * arr1 and arr2 have to be convertible to the types * in the result geometry-traits. * The overlay-traits class defines the various * overlay operations of pairs of DCEL features from * TopologyTraitsA and TopologyTraitsB to the resulting ResDcel. */ template void overlay(const Arrangement_on_surface_2& arr1, const Arrangement_on_surface_2& arr2, Arrangement_on_surface_2& arr, OverlayTraits& ovl_tr) { typedef GeometryTraitsA_2 Agt2; typedef GeometryTraitsB_2 Bgt2; typedef GeometryTraitsRes_2 Rgt2; typedef TopologyTraitsA Att; typedef TopologyTraitsB Btt; typedef TopologyTraitsRes Rtt; typedef OverlayTraits Overlay_traits; typedef Arrangement_on_surface_2 Arr_a; typedef Arrangement_on_surface_2 Arr_b; typedef Arrangement_on_surface_2 Arr_res; typedef typename Arr_res::Allocator Allocator; // some type assertions (not all, but better than nothing). typedef typename Agt2::Point_2 A_point; typedef typename Bgt2::Point_2 B_point; typedef typename Rgt2::Point_2 Res_point; static_assert(std::is_convertible::value); static_assert(std::is_convertible::value); typedef typename Agt2::X_monotone_curve_2 A_xcv; typedef typename Bgt2::X_monotone_curve_2 B_xcv; typedef typename Rgt2::X_monotone_curve_2 Res_xcv; static_assert(std::is_convertible::value); static_assert(std::is_convertible::value); typedef Arr_traits_basic_adaptor_2 Gt_adaptor_2; typedef Arr_overlay_traits_2 Ovl_gt2; typedef Arr_overlay_event Ovl_event; typedef Arr_overlay_subcurve Ovl_curve; typedef typename TopologyTraitsRes::template Overlay_helper Ovl_helper; typedef Arr_overlay_ss_visitor Ovl_visitor; typedef typename Ovl_gt2::X_monotone_curve_2 Ovl_x_monotone_curve_2; typedef typename Ovl_gt2::Point_2 Ovl_point_2; typedef typename Ovl_gt2::Cell_handle_red Cell_handle_red; typedef typename Ovl_gt2::Optional_cell_red Optional_cell_red; typedef typename Ovl_gt2::Cell_handle_blue Cell_handle_blue; typedef typename Ovl_gt2::Optional_cell_blue Optional_cell_blue; CGAL_USE_TYPE(Optional_cell_red); CGAL_USE_TYPE(Optional_cell_blue); // The result arrangement cannot be on of the input arrangements. CGAL_precondition(((void*)(&arr) != (void*)(&arr1)) && ((void*)(&arr) != (void*)(&arr2))); // Prepare a vector of extended x-monotone curves that represent all edges // in both input arrangements. Each curve is associated with a halfedge // directed from right to left. typename Arr_a::Halfedge_const_handle invalid_he1; typename Arr_b::Halfedge_const_handle invalid_he2; std::vector xcvs_vec(arr1.number_of_edges() + arr2.number_of_edges()); unsigned int i = 0; typename Arr_a::Edge_const_iterator eit1; for (eit1 = arr1.edges_begin(); eit1 != arr1.edges_end(); ++eit1, ++i) { typename Arr_a::Halfedge_const_handle he1 = eit1; if (he1->direction() != ARR_RIGHT_TO_LEFT) he1 = he1->twin(); xcvs_vec[i] = Ovl_x_monotone_curve_2(eit1->curve(), he1, invalid_he2); } typename Arr_b::Edge_const_iterator eit2; for (eit2 = arr2.edges_begin(); eit2 != arr2.edges_end(); ++eit2, ++i) { typename Arr_b::Halfedge_const_handle he2 = eit2; if (he2->direction() != ARR_RIGHT_TO_LEFT) he2 = he2->twin(); xcvs_vec[i] = Ovl_x_monotone_curve_2(eit2->curve(), invalid_he1, he2); } // Obtain an extended traits-class object and define the sweep-line visitor. const typename Arr_res::Traits_adaptor_2* traits_adaptor = arr.traits_adaptor(); /* We would like to avoid copy construction of the geometry traits class. * Copy construction is undesired, because it may results with data * duplication or even data loss. * * If the type Ovl_gt2 is the same as the type * GeomTraits, use a reference to GeomTraits to avoid constructing a new one. * Otherwise, instantiate a local variable of the former and provide * the latter as a single parameter to the constructor. * * Use the form 'A a(*b);' and not ''A a = b;' to handle the case where A has * only an implicit constructor, (which takes *b as a parameter). */ std::conditional_t, const Ovl_gt2&, Ovl_gt2> ex_traits(*traits_adaptor); Ovl_visitor visitor(&arr1, &arr2, &arr, &ovl_tr); Ss2::Surface_sweep_2 surface_sweep(&ex_traits, &visitor); // In case both arrangement do not contain isolated vertices, go on and // overlay them. const std::size_t total_iso_verts = arr1.number_of_isolated_vertices() + arr2.number_of_isolated_vertices(); if (total_iso_verts == 0) { // Clear the result arrangement and perform the sweep to construct it. arr.clear(); if (std::is_same::value) surface_sweep.sweep (xcvs_vec.begin(), xcvs_vec.end()); else surface_sweep.indexed_sweep (xcvs_vec, Indexed_sweep_accessor (arr1, arr2)); xcvs_vec.clear(); return; } // Prepare a vector of extended points that represent all isolated vertices // in both input arrangements. std::vector pts_vec(total_iso_verts); i = 0; typename Arr_a::Vertex_const_iterator vit1; for (vit1 = arr1.vertices_begin(); vit1 != arr1.vertices_end(); ++vit1) { if (vit1->is_isolated()) { typename Arr_a::Vertex_const_handle v1 = vit1; pts_vec[i++] = Ovl_point_2(vit1->point(), std::make_optional(Cell_handle_red(v1)), std::optional()); } } typename Arr_b::Vertex_const_iterator vit2; for (vit2 = arr2.vertices_begin(); vit2 != arr2.vertices_end(); ++vit2) { if (vit2->is_isolated()) { typename Arr_b::Vertex_const_handle v2 = vit2; pts_vec[i++] = Ovl_point_2(vit2->point(), std::optional(), std::make_optional(Cell_handle_blue(v2))); } } // Clear the result arrangement and perform the sweep to construct it. arr.clear(); if (std::is_same::value) surface_sweep.sweep(xcvs_vec.begin(), xcvs_vec.end(), pts_vec.begin(), pts_vec.end()); else surface_sweep.indexed_sweep (xcvs_vec, Indexed_sweep_accessor (arr1, arr2), pts_vec.begin(), pts_vec.end()); xcvs_vec.clear(); pts_vec.clear(); } /*! Compute the (simple) overlay of two input arrangements. * \param[in] arr1 the first arrangement. * \param[in] arr2 the second arrangement. * \param[out] arr the resulting arrangement. */ template void overlay(const Arrangement_on_surface_2& arr1, const Arrangement_on_surface_2& arr2, Arrangement_on_surface_2& arr) { typedef GeometryTraitsA_2 Agt2; typedef GeometryTraitsB_2 Bgt2; typedef GeometryTraitsRes_2 Rgt2; typedef TopologyTraitsA Att; typedef TopologyTraitsB Btt; typedef TopologyTraitsRes Rtt; typedef Arrangement_on_surface_2 Arr_a; typedef Arrangement_on_surface_2 Arr_b; typedef Arrangement_on_surface_2 Arr_res; _Arr_default_overlay_traits_base ovl_traits; overlay(arr1, arr2, arr, ovl_traits); } } // namespace CGAL #include #endif