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
/********************************************************************** * * GEOS - Geometry Engine Open Source * http://geos.osgeo.org * * Copyright (C) 2021 Paul Ramsey * * This is free software; you can redistribute and/or modify it under * the terms of the GNU Lesser General Public Licence as published * by the Free Software Foundation. * See the COPYING file for more information. * **********************************************************************/ #pragma once #include #include #include #include namespace geos { namespace geom { class Envelope; class LinearRing; class LineString; class Polygon; } namespace simplify { class RingHullIndex; } } using geos::geom::Coordinate; using geos::geom::Envelope; using geos::geom::LinearRing; using geos::geom::LineString; using geos::geom::Polygon; using geos::index::VertexSequencePackedRtree; namespace geos { namespace simplify { // geos::simplify class RingHull { public: /* * Creates a new instance. * * @param p_ring the ring vertices to process * @param p_isOuter whether the hull is outer or inner */ RingHull(const LinearRing* p_ring, bool p_isOuter); void setMinVertexNum(std::size_t minVertexNum); void setMaxAreaDelta(double maxAreaDelta); const Envelope* getEnvelope() const; std::unique_ptr getHull(RingHullIndex& hullIndex); static bool isConvex(const LinkedRing& vertexRing, std::size_t index); static double area(const LinkedRing& vertexRing, std::size_t index); void compute(RingHullIndex& hullIndex); std::unique_ptr toGeometry() const; private: class Corner { private: std::size_t index; std::size_t prev; std::size_t next; double area; public: Corner(std::size_t p_idx, std::size_t p_prev, std::size_t p_next, double p_area) : index(p_idx) , prev(p_prev) , next(p_next) , area(p_area) {}; inline int compareTo(const Corner& rhs) const { if (area == rhs.getArea()) { if (index == rhs.getIndex()) return 0; else return index < rhs.getIndex() ? -1 : 1; } else return area < rhs.getArea() ? -1 : 1; } inline bool operator< (const Corner& rhs) const { return compareTo(rhs) < 0; }; inline bool operator> (const Corner& rhs) const { return compareTo(rhs) > 0; }; inline bool operator==(const Corner& rhs) const { return compareTo(rhs) == 0; }; bool isVertex(std::size_t p_index) const; std::size_t getIndex() const; double getArea() const; void envelope(const LinkedRing& ring, Envelope& env) const; bool intersects(const Coordinate& v, const LinkedRing& ring) const; bool isRemoved(const LinkedRing& ring) const; std::unique_ptr toLineString(const LinkedRing& ring); struct Greater { inline bool operator()(const Corner & a, const Corner & b) const { return a > b; } }; using PriorityQueue = std::priority_queue, Corner::Greater>; }; // class Corner const LinearRing* inputRing; double targetVertexNum = -1.0; double targetAreaDelta = -1.0; /** * The polygon vertices are provided in CW orientation. * Thus for convex interior angles * the vertices forming the angle are in CW orientation. */ std::unique_ptr vertex; std::unique_ptr vertexRing; double areaDelta = 0; /** * Indexing vertices improves corner intersection testing performance. * The ring vertices are contiguous, so are suitable for a * {@link VertexSequencePackedRtree}. */ std::unique_ptr vertexIndex; Corner::PriorityQueue cornerQueue; void init(CoordinateSequence& ring, bool isOuter); void addCorner(std::size_t i, Corner::PriorityQueue& cornerQueue); bool isAtTarget(const Corner& corner); /** * Removes a corner by removing the apex vertex from the ring. * Two new corners are created with apexes * at the other vertices of the corner * (if they are non-convex and thus removable). * * @param corner the corner to remove * @param cornerQueue the corner queue */ void removeCorner(const Corner& corner, Corner::PriorityQueue& cornerQueue); bool isRemovable(const Corner& corner, const RingHullIndex& hullIndex) const; /** * Tests if any vertices in a hull intersect the corner triangle. * Uses the vertex spatial index for efficiency. * * @param corner the corner vertices * @param cornerEnv the envelope of the corner * @param hull the hull to test * @return true if there is an intersecting vertex */ bool hasIntersectingVertex( const Corner& corner, const Envelope& cornerEnv, const RingHull* hull) const; const Coordinate& getCoordinate(std::size_t index) const; void query( const Envelope& cornerEnv, std::vector& result) const; void queryHull(const Envelope& queryEnv, std::vector& pts); }; // RingHull } // geos::simplify } // geos