@crossbind/port-geos-linuxmusl 0.0.0-bootstrap.0 → 2.0.0-beta.63

package/dist/prebuilt/linuxmusl-x64-mt-release/include/geos/coverage/CoverageCleaner.h

@@ -0,0 +1,349 @@
+/**********************************************************************
+ *
+ * GEOS - Geometry Engine Open Source
+ * http://geos.osgeo.org
+ *
+ * Copyright (c) 2025 Martin Davis
+ * Copyright (C) 2025 Paul Ramsey <pramsey@cleverelephant.ca>
+ *
+ * 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 <geos/index/strtree/TemplateSTRtree.h>
+#include <geos/coverage/CleanCoverage.h>
+#include <geos/geom/Envelope.h>
+#include <geos/constants.h>
+#include <geos/export.h>
+
+#include <vector>
+#include <memory>
+#include <map>
+
+
+// Forward declarations
+namespace geos {
+namespace geom {
+    class Coordinate;
+    class CoordinateSequence;
+    class Geometry;
+    class GeometryFactory;
+    class LineString;
+    class LinearRing;
+    class Polygon;
+}
+namespace index {
+}
+namespace noding {
+    class SegmentString;
+}
+namespace coverage {
+    class CleanCoverage;
+}
+}
+
+namespace geos {         // geos.
+namespace coverage { // geos.coverage
+
+
+/**
+ * Cleans the linework of a set of polygonal geometries to form a valid polygonal coverage.
+ * The input is an array of valid Polygon or MultiPolygon geometries
+ * which may contain topological errors such as overlaps and gaps.
+ * Empty or non-polygonal inputs are removed.
+ * Linework is snapped together to eliminate small discrepancies.
+ * Overlaps are merged with an adjacent polygon, according to a given merge strategy.
+ * Gaps narrower than a given width are filled and merged with an adjacent polygon.
+ * The output is an array of polygonal geometries forming a valid polygonal coverage.
+ *
+ * ** Snapping **
+ *
+ * Snapping to nearby vertices and line segment snapping
+ * is used to improve noding robustness
+ * and eliminate small errors in an efficient way,
+ * By default this uses a very small snapping distance
+ * based on the extent of the input data.
+ * The snapping distance may be specified explicitly.
+ * This can reduce the number of overlaps and gaps that need to be merged,
+ * and reduce the risk of spikes formed by merging gaps.
+ * However, a large snapping distance may introduce undesirable
+ * data alteration.
+ *
+ * ** Overlap Merging **
+ *
+ * Overlaps are merged with an adjacent polygon chosen according to a specified merge strategy.
+ * The supported strategies are:
+ *
+ *    * **Longest Border**: (default) merge with the polygon with longest shared border (#MERGE_LONGEST_BORDER.)
+ *    * **Maximum/Minimum Area**: merge with the polygon with largest or smallest area (#MERGE_MAX_AREA, #MERGE_MIN_AREA.)
+ *    * **Minimum Index**: merge with the polygon with the lowest index in the input array (#MERGE_MIN_INDEX.)
+ *
+ * This allows sorting the input according to some criteria to provide a priority
+ * for merging gaps.
+ *
+ * ** Gap Merging **
+ *
+ * Gaps which are wider than a given distance are merged with an adjacent polygon.
+ * Polygon width is determined as twice the radius of the MaximumInscribedCircle
+ * of the gap polygon.
+ * Gaps are merged with the adjacent polygon with longest shared border.
+ * Empty holes in input polygons are treated as gaps, and may be filled in.
+ * Gaps which are not fully enclosed ("inlets") are not removed.
+ *
+ * Cleaning can be run on a valid coverage to remove gaps.
+ *
+ *
+ * The clean result is an array of polygonal geometries
+ * which match one-to-one with the input array.
+ * A result item may be <tt>null</tt> if:
+ *
+ *    * the input item is non-polygonal or empty
+ *    * the input item is so small it is snapped to collapse
+ *    * the input item is covered by another input item
+ *        (which may be a larger or a duplicate (nearly or exactly) geometry)
+ *
+ * The result is a valid coverage according to CoverageValidator#isValid();
+ *
+ * ** Known Issues **
+ *
+ *    * Long narrow gaps adjacent to multiple polygons may form spikes when merged with a single polygon.
+ *
+ * ** Future Enhancements **
+ *
+ *    * Provide an area-based tolerance for gap merging
+ *    * Prevent long narrow gaps from forming spikes by partitioning them before merging.
+ *    * Allow merging narrow parts of a gap while leaving wider portions.
+ *    * Support a priority value for each input polygon to control overlap and gap merging
+ *        (this could also allow blocking polygons from being merge targets)
+ *
+ * @see CoverageValidator
+ * @author Martin Davis
+ *
+ */
+class GEOS_DLL CoverageCleaner {
+
+    using Coordinate = geos::geom::Coordinate;
+    using CoordinateSequence = geos::geom::CoordinateSequence;
+    using Geometry = geos::geom::Geometry;
+    using GeometryFactory = geos::geom::GeometryFactory;
+    using Point = geos::geom::Point;
+    using Polygon = geos::geom::Polygon;
+    using LineString = geos::geom::LineString;
+    using LinearRing = geos::geom::LinearRing;
+    using Envelope = geos::geom::Envelope;
+    using SegmentString = geos::noding::SegmentString;
+
+public:
+
+    /** Merge strategy that chooses polygon with longest common border */
+    static constexpr int MERGE_LONGEST_BORDER = 0;
+    /** Merge strategy that chooses polygon with maximum area */
+    static constexpr int MERGE_MAX_AREA       = 1;
+    /** Merge strategy that chooses polygon with minimum area */
+    static constexpr int MERGE_MIN_AREA       = 2;
+    /** Merge strategy that chooses polygon with smallest input index */
+    static constexpr int MERGE_MIN_INDEX      = 3;
+
+private:
+
+    std::vector<const Geometry*> coverage;
+    const GeometryFactory* geomFactory;
+    double snappingDistance;
+
+    double gapMaximumWidth = 0.0;
+    int overlapMergeStrategy = MERGE_LONGEST_BORDER;
+    std::unique_ptr<index::strtree::TemplateSTRtree<std::size_t>> covIndex;
+    std::vector<std::unique_ptr<Polygon>> resultants;
+    std::unique_ptr<CleanCoverage> cleanCov;
+    std::map<std::size_t, std::vector<std::size_t>> overlapParentMap;
+    std::vector<const Polygon*> overlaps;
+    std::vector<const Polygon*> gaps;
+    std::vector<const Polygon*> mergableGaps;
+
+    static constexpr double DEFAULT_SNAPPING_FACTOR = 1.0e8;
+
+
+    static double computeDefaultSnappingDistance(
+        std::vector<const Geometry*>& geoms);
+
+    static Envelope extent(std::vector<const Geometry*>& geoms);
+
+    void mergeOverlaps(
+        std::map<std::size_t, std::vector<std::size_t>>& overlapMap);
+
+    std::unique_ptr<CleanCoverage::MergeStrategy> mergeStrategy(
+        int mergeStrategyId);
+
+    void computeResultants(double tolerance);
+
+    void createCoverageIndex();
+
+    void classifyResult(std::vector<std::unique_ptr<Polygon>>& rs);
+
+    void classifyResultant(std::size_t resultIndex, const Polygon* resPoly);
+
+    static bool covers(const Geometry* poly, const Point* intPt);
+
+    std::vector<const Polygon*> findMergableGaps(
+        std::vector<const Polygon*> gaps);
+
+    bool isMergableGap(const Polygon* gap);
+
+    static std::vector<std::unique_ptr<geom::Polygon>> polygonize(
+        const Geometry* cleanEdges);
+
+    static bool isPolygonal(const Geometry* geom);
+
+    static std::vector<const Polygon*> toPolygonArray(
+        const Geometry* geom);
+
+
+public:
+
+    /**
+     * Create a new cleaner instance for a set of polygonal geometries.
+     *
+     * @param coverage an array of polygonal geometries to clean
+     */
+    CoverageCleaner(std::vector<const Geometry*>& coverage);
+
+    /**
+     * Cleans a set of polygonal geometries to form a valid coverage,
+     * allowing all cleaning parameters to be specified.
+     *
+     * @param coverage an array of polygonal geometries to clean
+     * @param snapDistance the distance tolerance for snapping
+     * @param mergeStrategy the strategy to use for merging overlaps
+     * @param maxWidth the maximum width of gaps to merge
+     * @return the clean coverage
+     */
+    static std::vector<std::unique_ptr<Geometry>> clean(
+        std::vector<const Geometry*>& coverage,
+        double snapDistance,
+        int mergeStrategy,
+        double maxWidth);
+
+    /**
+     * Cleans a set of polygonal geometries to form a valid coverage,
+     * using the default overlap merge strategy {@link #MERGE_LONGEST_BORDER}.
+     *
+     * @param coverage an array of polygonal geometries to clean
+     * @param snapDistance the distance tolerance for snapping
+     * @param maxWidth the maximum width of gaps to merge
+     * @return the clean coverage
+     */
+    static std::vector<std::unique_ptr<Geometry>> clean(
+        std::vector<const Geometry*>& coverage,
+        double snapDistance,
+        double maxWidth);
+
+    /**
+     * Cleans a set of polygonal geometries to form a valid coverage,
+     * using the default snapping distance tolerance.
+     *
+     * @param coverage an array of polygonal geometries to clean
+     * @param mergeStrategy the strategy to use for merging overlaps
+     * @param maxWidth the maximum width of gaps to merge
+     * @return the clean coverage
+     */
+    static std::vector<std::unique_ptr<Geometry>> cleanOverlapGap(
+        std::vector<const Geometry*>& coverage,
+        int mergeStrategy,
+        double maxWidth);
+
+    /**
+     * Cleans a set of polygonal geometries to form a valid coverage,
+     * with default snapping tolerance and overlap merging,
+     * and merging gaps which are narrower than a specified width.
+     *
+     * @param coverage an array of polygonal geometries to clean
+     * @param maxWidth the maximum width of gaps to merge
+     * @return the clean coverage
+     */
+    static std::vector<std::unique_ptr<Geometry>> cleanGapWidth(
+        std::vector<const Geometry*>& coverage,
+        double maxWidth);
+
+    /**
+     * Sets the snapping distance tolerance.
+     * The default is to use a small fraction of the input extent diameter.
+     * A distance of zero prevents snapping from being used.
+     *
+     * @param snapDistance the snapping distance tolerance
+     */
+    void setSnappingDistance(double snapDistance);
+
+    /**
+     * Sets the overlap merge strategy to use.
+     * The default is {@link #MERGE_LONGEST_BORDER}.
+     *
+     * @param mergeStrategy the merge strategy code
+     */
+    void setOverlapMergeStrategy(int mergeStrategy);
+
+    /**
+     * Sets the maximum width of the gaps that will be filled and merged.
+     * The width of a gap is the diameter of the Maximum Inscribed Circle in the gap polygon.
+     * A width of zero prevents gaps from being merged.
+     *
+     * @param maxWidth the maximum gap width to merge
+     */
+    void setGapMaximumWidth(double maxWidth);
+
+    /**
+     * Cleans the coverage.
+     */
+    void clean();
+
+    /**
+     * Gets the cleaned coverage.
+     *
+     * @return the clean coverage
+     */
+    std::vector<std::unique_ptr<Geometry>> getResult();
+
+    /**
+     * Gets polygons representing the overlaps in the input,
+     * which have been merged.
+     *
+     * @return a list of overlap polygons
+     */
+    std::vector<const Polygon*> getOverlaps();
+
+    /**
+     * Gets polygons representing the gaps in the input
+     * which have been merged.
+     *
+     * @return a list of gap polygons
+     */
+    std::vector<const Polygon*> getMergedGaps();
+
+    static std::unique_ptr<Geometry> toGeometry(
+        std::vector<std::unique_ptr<SegmentString>>& segStrings,
+        const GeometryFactory* geomFact);
+
+    std::unique_ptr<Geometry> node(
+        std::vector<const Geometry*>& coverage,
+        double snapDistance);
+
+    /**
+     * Disable copy construction and assignment. Apparently needed to make this
+     * class compile under MSVC. (See https://stackoverflow.com/q/29565299)
+     */
+    CoverageCleaner(const CoverageCleaner&) = delete;
+    CoverageCleaner& operator=(const CoverageCleaner&) = delete;
+
+};
+
+} // namespace geos.coverage
+} // namespace geos
+
+
+
+
+

package/dist/prebuilt/linuxmusl-x64-mt-release/include/geos/coverage/CoverageEdge.h

@@ -0,0 +1,171 @@
+
+
+
+/**********************************************************************
+ *
+ * GEOS - Geometry Engine Open Source
+ * http://geos.osgeo.org
+ *
+ * Copyright (C) 2022 Paul Ramsey <pramsey@cleverelephant.ca>
+ *
+ * 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 <geos/geom/CoordinateSequence.h>
+#include <geos/geom/LineSegment.h>
+#include <geos/util.h>
+
+// Forward declarations
+namespace geos {
+namespace geom {
+class Coordinate;
+class LinearRing;
+class LineString;
+class MultiLineString;
+class GeometryFactory;
+}
+}
+
+namespace geos {      // geos.
+namespace coverage { // geos.coverage
+
+/**
+ * An edge of a polygonal coverage formed from all or a section of a polygon ring.
+ * An edge may be a free ring, which is a ring which has not node points
+ * (i.e. does not touch any other rings in the parent coverage).
+ *
+ * @author mdavis
+ *
+ */
+class GEOS_DLL CoverageEdge {
+    using Coordinate = geos::geom::Coordinate;
+    using CoordinateSequence = geos::geom::CoordinateSequence;
+    using GeometryFactory = geos::geom::GeometryFactory;
+    using LinearRing = geos::geom::LinearRing;
+    using LineString = geos::geom::LineString;
+    using LineSegment = geos::geom::LineSegment;
+    using MultiLineString = geos::geom::MultiLineString;
+
+
+private:
+
+    // Members
+    std::shared_ptr<const CoordinateSequence> m_pts;
+    std::size_t m_ringCount ;
+    bool m_isFreeRing = true;
+
+    // Methods
+
+    static std::unique_ptr<CoordinateSequence>
+    extractEdgePoints(const CoordinateSequence& ring,
+        std::size_t start, std::size_t end);
+
+    static const Coordinate&
+    findDistinctPoint(
+        const CoordinateSequence& pts,
+        std::size_t index,
+        bool isForward,
+        const Coordinate& pt);
+
+
+public:
+
+    CoverageEdge(std::unique_ptr<CoordinateSequence> && pts, bool isFreeRing)
+        : m_pts(pts ? std::move(pts) : detail::make_unique<CoordinateSequence>())
+        , m_ringCount(0)
+        , m_isFreeRing(isFreeRing)
+        {}
+
+    /**
+    * Computes a key segment for a ring.
+    * The key is the segment starting at the lowest vertex,
+    * towards the lowest adjacent distinct vertex.
+    *
+    * @param ring a linear ring
+    * @return a LineSegment representing the key
+    */
+    static LineSegment key(
+        const CoordinateSequence& ring);
+
+    /**
+    * Computes a distinct key for a section of a linear ring.
+    *
+    * @param ring the linear ring
+    * @param start index of the start of the section
+    * @param end end index of the end of the section
+    * @return a LineSegment representing the key
+    */
+    static LineSegment key(
+        const CoordinateSequence& ring,
+        std::size_t start,
+        std::size_t end);
+
+    static std::unique_ptr<CoverageEdge> createEdge(
+        const CoordinateSequence& ring);
+
+    static std::unique_ptr<CoverageEdge> createEdge(
+        const CoordinateSequence& ring,
+        std::size_t start,
+        std::size_t end);
+
+    static std::unique_ptr<MultiLineString> createLines(
+        const std::vector<CoverageEdge*>& edges,
+        const GeometryFactory* geomFactory);
+
+    std::unique_ptr<LineString> toLineString(
+        const GeometryFactory* geomFactory) const;
+
+    /* public */
+    void incRingCount()
+    {
+        m_ringCount++;
+    }
+
+    /* public */
+    std::size_t getRingCount() const
+    {
+        return m_ringCount;
+    }
+
+    /**
+    * Returns whether this edge is a free ring;
+    * i.e. one with no constrained nodes.
+    *
+    * @return true if this is a free ring
+    */
+    bool isFreeRing() const
+    {
+        return m_isFreeRing;
+    }
+
+    void setCoordinates(const std::shared_ptr<const CoordinateSequence>& pts)
+    {
+        m_pts = pts;
+    }
+
+    const std::shared_ptr<const CoordinateSequence>& getCoordinates() const
+    {
+        return m_pts;
+    }
+
+    const Coordinate& getEndCoordinate() const
+    {
+        return m_pts->getAt(m_pts->size() - 1);
+    }
+
+    const Coordinate& getStartCoordinate() const
+    {
+        return m_pts->getAt(0);
+    }
+
+
+};
+
+} // namespace geos.coverage
+} // namespace geos

package/dist/prebuilt/linuxmusl-x64-mt-release/include/geos/coverage/CoverageEdges.h

@@ -0,0 +1,61 @@
+/**********************************************************************
+ *
+ * GEOS - Geometry Engine Open Source
+ * http://geos.osgeo.org
+ *
+ * Copyright (C) 2026 Paul Ramsey <pramsey@cleverelephant.ca>
+ *
+ * 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 <geos/export.h>
+#include <memory>
+#include <vector>
+
+// Forward declarations
+namespace geos {
+namespace geom {
+class Geometry;
+}
+}
+
+namespace geos {      // geos
+namespace coverage { // geos::coverage
+
+/**
+ * Utility to extract unique edges from a polygonal coverage.
+ *
+ * @author Paul Ramsey
+ *
+ */
+class GEOS_DLL CoverageEdges {
+public:
+
+    /**
+    * Returns a MultiLineString representing the unique edges of a polygonal coverage.
+    *
+    * @param coverage a vector of polygons in the coverage
+    * @param type selection type: 0 = ALL, 1 = EXTERIOR (non-shared), 2 = INTERIOR (shared)
+    * @return a MultiLineString of unique edges
+    */
+    static std::unique_ptr<geom::Geometry> GetEdges(const std::vector<const geom::Geometry*>& coverage, int type = 0);
+
+    /**
+    * Returns a MultiLineString representing the unique edges of a polygonal coverage.
+    *
+    * @param coverage a GeometryCollection or MultiPolygon representing the coverage
+    * @param type selection type: 0 = ALL, 1 = EXTERIOR (non-shared), 2 = INTERIOR (shared)
+    * @return a MultiLineString of unique edges
+    */
+    static std::unique_ptr<geom::Geometry> GetEdges(const geom::Geometry* coverage, int type = 0);
+
+};
+
+} // namespace geos::coverage
+} // namespace geos

package/dist/prebuilt/linuxmusl-x64-mt-release/include/geos/coverage/CoverageGapFinder.h

@@ -0,0 +1,106 @@
+/**********************************************************************
+ *
+ * GEOS - Geometry Engine Open Source
+ * http://geos.osgeo.org
+ *
+ * Copyright (C) 2022 Paul Ramsey <pramsey@cleverelephant.ca>
+ *
+ * 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 <geos/export.h>
+#include <vector>
+#include <memory>
+
+
+// Forward declarations
+namespace geos {
+namespace geom {
+class Geometry;
+class LinearRing;
+}
+}
+
+
+
+namespace geos {      // geos
+namespace coverage { // geos::coverage
+
+/**
+ * Finds gaps in a polygonal coverage.
+ * Gaps are holes in the coverage which are narrower than a given width.
+ *
+ * The coverage should be valid according to CoverageValidator.
+ * If this is not the case, some gaps may not be reported, or the invocation may fail.
+ *
+ * This is a more accurate way of identifying gaps
+ * than using CoverageValidator::setGapWidth(double).
+ * Gaps which separate the coverage into two disjoint regions are not detected.
+ * Gores are not identified as gaps.
+ *
+ * @author mdavis
+ *
+ */
+class GEOS_DLL CoverageGapFinder {
+    using Geometry = geos::geom::Geometry;
+    using LinearRing = geos::geom::LinearRing;
+
+private:
+
+    std::vector<const Geometry*>& m_coverage;
+
+    bool isGap(const LinearRing* hole, double gapWidth);
+
+
+public:
+
+    /**
+    * Creates a new polygonal coverage gap finder.
+    *
+    * @param coverage a set of polygons forming a polygonal coverage
+    */
+    CoverageGapFinder(std::vector<const Geometry*>& coverage)
+        : m_coverage(coverage)
+        {};
+
+    /**
+    * Finds gaps in a polygonal coverage.
+    * Returns lines indicating the locations of the gaps.
+    *
+    * @param coverage a set of polygons forming a polygonal coverage
+    * @param gapWidth the maximum width of gap to detect
+    * @return a geometry indicating the locations of gaps (which is empty if no gaps were found), or null if the coverage was empty
+    */
+    static std::unique_ptr<Geometry> findGaps(
+        std::vector<const Geometry*>& coverage,
+        double gapWidth);
+
+    /**
+    * Finds gaps in the coverage.
+    * Returns lines indicating the locations of the gaps.
+    *
+    * @param gapWidth the maximum width of gap to detect
+    * @return a geometry indicating the locations of gaps (which is empty if no gaps were found), or null if the coverage was empty
+    */
+    std::unique_ptr<Geometry> findGaps(double gapWidth);
+
+
+};
+
+} // namespace geos::coverage
+} // namespace geos
+
+
+
+
+
+
+
+
+