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 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/Boolean_set_operations_2/include/CGAL/IO/Dxf_bsop_reader.h $ // $Id: include/CGAL/IO/Dxf_bsop_reader.h b26b07a1242 $ // SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial // // // Author(s) : Baruch Zukerman // Ron Wein #ifndef CGAL_DXF_BSOP_READER_H #define CGAL_DXF_BSOP_READER_H #include #include #include #include #include #include #include #include #include namespace CGAL { template class Dxf_bsop_reader { private: typedef Kernel_ Kernel; typedef typename Kernel::FT FT; typedef typename Kernel::Point_2 Point_2; typedef typename Kernel::Circle_2 Circle_2; typedef std::list > Dxf_polygon_2; typedef std::list Dxf_polygons_list; typedef std::pair Dxf_circle_2; typedef std::list Dxf_circles_list; typedef CGAL::Dxf_reader Dxf_reader; typedef CGAL::Gps_circle_segment_traits_2 Traits_2; typedef typename Traits_2::Point_2 Arc_point_2; typedef typename Traits_2::Curve_2 Curve_2; typedef typename Traits_2::X_monotone_curve_2 X_monotone_curve_2; public: typedef typename Traits_2::Polygon_2 Circ_polygon_2; typedef typename Traits_2::Polygon_with_holes_2 Circ_polygon_with_holes_2; private: typedef std::vector Circ_pgn_vec; typedef std::vector Circ_pgn_with_holes_vec; typedef CGAL::General_polygon_set_2 Circ_pgn_set_2; public: /*! * Read a set of circular polygons from a DXF file. * \param in_file A file stream in DXF format. * \param pgns An output iterator of Circ_polygon_2 objects. * \param pgns_with_holes An output iterator of Circ_polygon_with_holes_2 * objects. * \param simplify Should we simplify the polygons (in case the file * contains polygons that are not simple). * \return A pair of past-the-end iterators for both ranges. */ template std::pair operator() (std::ifstream& in_file, PolygonOutputIterator pgns, PolygonWithHolesOutputIterator pgns_with_holes, bool simplify = true) { // Read polygons and circles from the DXF file. Circ_pgn_set_2 gps; Dxf_polygons_list polygons; Dxf_circles_list circles; Dxf_reader reader; reader (in_file, polygons, circles); // Convert the circles, such that each circle becomes a simple polygon // with two edges (the upper and the lower half-circles). Traits_2 traits; typename Traits_2::Make_x_monotone_2 make_x_monotone = traits.make_x_monotone_2_object(); typename Dxf_circles_list::iterator circ_it; for (circ_it = circles.begin(); circ_it != circles.end(); ++circ_it) { // Break the circle into two x-monotone circular arcs. const Dxf_circle_2& dxf_circ = *circ_it; Curve_2 circ (dxf_circ.first, dxf_circ.second); Circ_polygon_2 pgn; make_x_monotone (circ, CGAL::dispatch_or_drop_output(std::back_inserter(pgn))); CGAL_assertion(pgn.size() == 2); *pgns++ = pgn; } circles.clear(); // Convert the DXF polygons into circular polygons. Kernel ker; typename Kernel::Equal_2 equal = ker.equal_2_object(); typename Dxf_polygons_list::iterator pgn_it; typename Dxf_polygon_2::iterator curr, next; Point_2 ps, pt; Circle_2 supp_circ; for (pgn_it = polygons.begin(); pgn_it != polygons.end(); ++pgn_it) { Circ_polygon_2 pgn; for (curr = pgn_it->begin(); curr != pgn_it->end(); ++curr) { // Get the current vertex ps and the next vertex pt (in a circular // sense). next = curr; ++next; ps = curr->first; if (next != pgn_it->end()) pt = next->first; else pt = pgn_it->begin()->first; // Check whether a "bulge" is defined between the two vertices. if (curr->second) { // A non-zero bulge: ps and pt are connected by a circular arc. // We compute the center and the squared radius of its supporting // circle. CGAL_assertion (! equal (ps, pt)); const FT bulge = curr->second; const FT common = (1 - CGAL::square(bulge)) / (4*bulge); const FT x_coord = ((ps.x() + pt.x())/2) + common*(ps.y() - pt.y()); const FT y_coord = ((ps.y() + pt.y())/2) + common*(pt.x() - ps.x()); const FT sqr_bulge = CGAL::square(bulge); const FT sqr_rad = CGAL::squared_distance(ps, pt) * (1/sqr_bulge + 2 + sqr_bulge) / 16; // Construct the arc: A positive bulge means the arc is // counterclockwise oriented and a negative bulge means that the arc // is clockwise oriented. if(bulge > 0) supp_circ = Circle_2 (Point_2 (x_coord, y_coord), sqr_rad, CGAL::COUNTERCLOCKWISE); else supp_circ = Circle_2 (Point_2 (x_coord, y_coord), sqr_rad, CGAL::CLOCKWISE); Curve_2 circ_arc (supp_circ, Arc_point_2 (ps.x(), ps.y()), Arc_point_2 (pt.x(), pt.y())); // Break the arc into x-monotone subarcs (there can be at most // three subarcs) and add them to the polygon. make_x_monotone (circ_arc, CGAL::dispatch_or_drop_output(std::back_inserter(pgn))); } else { // A zero bulge: ps and pt are connected by a straight line segment. if (! equal (ps, pt)) pgn.push_back (X_monotone_curve_2 (ps, pt)); } } // Make sure that the polygon is counterclockwise oriented. if (pgn.orientation() == CGAL::CLOCKWISE) pgn.reverse_orientation(); // Perform polygon simplification if necessary. if (!simplify) { *pgns = pgn; ++pgns; } else { Circ_polygon_with_holes_2 pgn_with_holes; gps.simplify (pgn, pgn_with_holes); if (pgn_with_holes.number_of_holes() == 0) { // A simple polygon after all ... *pgns = pgn_with_holes.outer_boundary(); ++pgns; } else { *pgns_with_holes = pgn_with_holes; ++pgns_with_holes; } } } polygons.clear(); // Return a pair of past-the-end iterators. return (std::make_pair (pgns, pgns_with_holes)); } }; } //namespace CGAL #include #endif