@cpp.js/package-geos 1.0.0 → 2.0.0-beta.1

package/geos.xcframework/ios-arm64_arm64e_x86_64-simulator/Headers/geos/noding/snapround/MCIndexSnapRounder.h

@@ -1,157 +0,0 @@
-/**********************************************************************
- *
- * GEOS - Geometry Engine Open Source
- * http://geos.osgeo.org
- *
- * Copyright (C) 2006      Refractions Research Inc.
- *
- * 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.
- *
- **********************************************************************
- *
- * Last port: noding/snapround/MCIndexSnapRounder.java r486 (JTS-1.12+)
- *
- **********************************************************************/
-
-#pragma once
-
-#include <geos/export.h>
-
-#include <geos/noding/Noder.h> // for inheritance
-#include <geos/noding/NodedSegmentString.h> // for inlines
-#include <geos/noding/snapround/MCIndexPointSnapper.h> // for inlines
-#include <geos/algorithm/LineIntersector.h> // for composition
-#include <geos/geom/Coordinate.h> // for use in vector
-#include <geos/geom/PrecisionModel.h> // for inlines
-
-#include <vector>
-
-#ifdef _MSC_VER
-#pragma warning(push)
-#pragma warning(disable: 4251) // warning C4251: needs to have dll-interface to be used by clients of class
-#endif
-
-// Forward declarations
-namespace geos {
-namespace algorithm {
-class LineIntersector;
-}
-namespace noding {
-class SegmentString;
-class MCIndexNoder;
-}
-}
-
-namespace geos {
-namespace noding { // geos::noding
-namespace snapround { // geos::noding::snapround
-
-
-/** \brief
- * Uses Snap Rounding to compute a rounded,
- * fully noded arrangement from a set of SegmentString
- *
- * Implements the Snap Rounding technique described in Hobby, Guibas & Marimont,
- * and Goodrich et al.
- *
- * Snap Rounding assumes that all vertices lie on a uniform grid
- * (hence the precision model of the input must be fixed precision,
- * and all the input vertices must be rounded to that precision).
- *
- * This implementation uses a monotone chains and a spatial index to
- * speed up the intersection tests.
- *
- * This implementation appears to be fully robust using an integer
- * precision model.
- *
- * It will function with non-integer precision models, but the
- * results are not 100% guaranteed to be correctly noded.
- */
-class GEOS_DLL MCIndexSnapRounder: public Noder { // implements Noder
-
-public:
-
-    MCIndexSnapRounder(const geom::PrecisionModel& nPm)
-        :
-        pm(nPm),
-        scaleFactor(nPm.getScale()),
-        pointSnapper(nullptr)
-    {
-        li.setPrecisionModel(&pm);
-    }
-
-    std::vector<SegmentString*>*
-    getNodedSubstrings() const override
-    {
-        return NodedSegmentString::getNodedSubstrings(*nodedSegStrings);
-    }
-
-    void computeNodes(std::vector<SegmentString*>* segStrings) override;
-
-    /**
-     * Computes nodes introduced as a result of
-     * snapping segments to vertices of other segments
-     *
-     * @param edges the list of segment strings to snap together
-     *        NOTE: they *must* be instances of NodedSegmentString, or
-     * 	            an assertion will fail.
-     */
-    void computeVertexSnaps(std::vector<SegmentString*>& edges);
-
-private:
-
-    /// externally owned
-    const geom::PrecisionModel& pm;
-
-    algorithm::LineIntersector li;
-
-    double scaleFactor;
-
-    std::vector<SegmentString*>* nodedSegStrings;
-
-    std::unique_ptr<MCIndexPointSnapper> pointSnapper;
-
-    void snapRound(MCIndexNoder& noder, std::vector<SegmentString*>* segStrings);
-
-
-    /**
-     * Computes all interior intersections in the collection of SegmentStrings,
-     * and push their Coordinate to the provided vector.
-     *
-     * Does NOT node the segStrings.
-     *
-     */
-    void findInteriorIntersections(MCIndexNoder& noder,
-                                   std::vector<SegmentString*>* segStrings,
-                                   std::vector<geom::Coordinate>& intersections);
-
-    /**
-     * Computes nodes introduced as a result of snapping
-     * segments to snap points (hot pixels)
-     */
-    void computeIntersectionSnaps(std::vector<geom::Coordinate>& snapPts);
-
-    /**
-     * Performs a brute-force comparison of every segment in each {@link SegmentString}.
-     * This has n^2 performance.
-     */
-    void computeVertexSnaps(NodedSegmentString* e);
-
-    void checkCorrectness(std::vector<SegmentString*>& inputSegmentStrings);
-
-    // Declare type as noncopyable
-    MCIndexSnapRounder(const MCIndexSnapRounder& other) = delete;
-    MCIndexSnapRounder& operator=(const MCIndexSnapRounder& rhs) = delete;
-};
-
-} // namespace geos::noding::snapround
-} // namespace geos::noding
-} // namespace geos
-
-#ifdef _MSC_VER
-#pragma warning(pop)
-#endif
-

package/geos.xcframework/ios-arm64_arm64e_x86_64-simulator/Headers/geos/noding/snapround/SnapRoundingIntersectionAdder.h

@@ -1,126 +0,0 @@
-/**********************************************************************
- *
- * GEOS - Geometry Engine Open Source
- * http://geos.osgeo.org
- *
- * Copyright (C) 2020 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>
-
-#include <geos/noding/Noder.h> // for inheritance
-#include <geos/algorithm/LineIntersector.h> // for composition
-#include <geos/geom/Coordinate.h> // for use in vector
-#include <geos/geom/CoordinateSequence.h>
-#include <geos/geom/PrecisionModel.h> // for inlines (should drop)
-#include <geos/noding/SegmentIntersector.h>
-
-
-// Forward declarations
-namespace geos {
-namespace geom {
-class PrecisionModel;
-}
-namespace noding {
-class SegmentString;
-class NodedSegmentString;
-namespace snapround {
-class HotPixel;
-}
-}
-}
-
-namespace geos {
-namespace noding { // geos::noding
-namespace snapround { // geos::noding::snapround
-
-/**
- * Finds intersections between line segments which will be snap-rounded,
- * and adds them as nodes to the segments.
- *
- * Intersections are detected and computed using full precision.
- * Snapping takes place in a subsequent phase.
- *
- * The intersection points are recorded, so that HotPixels can be created for them.
- *
- * To avoid robustness issues with vertices which lie very close to line segments
- * a heuristic is used:
- * nodes are created if a vertex lies within a tolerance distance
- * of the interior of a segment.
- * The tolerance distance is chosen to be significantly below the snap-rounding grid size.
- * This has empirically proven to eliminate noding failures.
- */
-class GEOS_DLL SnapRoundingIntersectionAdder: public SegmentIntersector { // implements SegmentIntersector
-
-private:
-
-    algorithm::LineIntersector li;
-    geom::CoordinateSequence intersections;
-    // const geom::PrecisionModel* pm;
-    double nearnessTol;
-
-    /**
-    * If an endpoint of one segment is near
-    * the interior of the other segment, add it as an intersection.
-    * EXCEPT if the endpoint is also close to a segment endpoint
-    * (since this can introduce "zigs" in the linework).
-    *
-    * This resolves situations where
-    * a segment A endpoint is extremely close to another segment B,
-    * but is not quite crossing.  Due to robustness issues
-    * in orientation detection, this can
-    * result in the snapped segment A crossing segment B
-    * without a node being introduced.
-    */
-    void processNearVertex(const geom::CoordinateSequence& seq0,
-                           std::size_t ptIndex,
-                           const geom::CoordinateSequence& seq1,
-                           std::size_t segIndex,
-                           SegmentString* edge);
-
-    bool isNearSegmentInterior(const geom::CoordinateXY& p, const geom::CoordinateXY& p0, const geom::CoordinateXY& p1) const;
-
-public:
-
-    SnapRoundingIntersectionAdder(double p_nearnessTol)
-        : SegmentIntersector()
-        , intersections(geom::CoordinateSequence::XYZM(0))
-        , nearnessTol(p_nearnessTol)
-    {}
-
-    geom::CoordinateSequence getIntersections() { return std::move(intersections); };
-
-    /**
-    * This method is called by clients
-    * of the {@link SegmentIntersector} class to process
-    * intersections for two segments of the {@link SegmentString}s being intersected.
-    * Note that some clients (such as MonotoneChains) may optimize away
-    * this call for segment pairs which they have determined do not intersect
-    * (e.g. by an disjoint envelope test).
-    */
-    void processIntersections(SegmentString* e0, std::size_t segIndex0, SegmentString* e1, std::size_t segIndex1) override;
-
-    /**
-    * Always process all intersections
-    *
-    */
-    bool isDone() const override { return false; }
-
-
-};
-
-} // namespace geos::noding::snapround
-} // namespace geos::noding
-} // namespace geos
-

package/geos.xcframework/ios-arm64_arm64e_x86_64-simulator/Headers/geos/noding/snapround/SnapRoundingNoder.h

@@ -1,167 +0,0 @@
-/**********************************************************************
- *
- * GEOS - Geometry Engine Open Source
- * http://geos.osgeo.org
- *
- * Copyright (C) 2006      Refractions Research Inc.
- *
- * 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.
- *
- **********************************************************************
- *
- * Last port: noding/snapround/SnapRoundingNoder.java r320 (JTS-1.12)
- *
- **********************************************************************/
-
-#pragma once
-
-#include <geos/export.h>
-
-#include <geos/geom/Coordinate.h>
-#include <geos/geom/Envelope.h>
-#include <geos/noding/snapround/HotPixelIndex.h>
-#include <geos/noding/Noder.h>
-
-
-// Forward declarations
-namespace geos {
-namespace geom {
-class Envelope;
-class PrecisionModel;
-}
-namespace noding {
-class NodedSegmentString;
-}
-}
-
-namespace geos {
-namespace noding { // geos::noding
-namespace snapround { // geos::noding::snapround
-
-/**
- * Uses Snap Rounding to compute a rounded,
- * fully noded arrangement from a set of {@link noding::SegmentString}s,
- * in a performant way, and avoiding unnecessary noding.
- *
- * Implements the Snap Rounding technique described in
- * the papers by Hobby, Guibas &amp; Marimont, and Goodrich et al.
- * Snap Rounding enforces that all output vertices lie on a uniform grid,
- * which is determined by the provided {@link geom::PrecisionModel}.
- *
- * Input vertices do not have to be rounded to the grid beforehand;
- * this is done during the snap-rounding process.
- * In fact, rounding cannot be done a priori,
- * since rounding vertices by themselves can distort the rounded topology
- * of the arrangement (i.e. by moving segments away from hot pixels
- * that would otherwise intersect them, or by moving vertices
- * across segments).
- *
- * To minimize the number of introduced nodes,
- * the Snap-Rounding Noder avoids creating nodes
- * at edge vertices if there is no intersection or snap at that location.
- * However, if two different input edges contain identical segments,
- * each of the segment vertices will be noded.
- * This still provides fully-noded output.
- * This is the same behaviour provided by other noders,
- * such as {@link noding::MCIndexNoder} and {@link noding::snap::SnappingNoder}.
- */
-class GEOS_DLL SnapRoundingNoder : public Noder {
-
-private:
-    /**
-    * The division factor used to determine
-    * nearness distance tolerance for interior intersection detection.
-    */
-    static constexpr int INTERSECTION_NEARNESS_FACTOR = 100;
-
-    // Members
-    const geom::PrecisionModel* pm;
-    noding::snapround::HotPixelIndex pixelIndex;
-    std::vector<SegmentString*> snappedResult;
-
-    // Methods
-    void snapRound(std::vector<SegmentString*>& inputSegStrings, std::vector<SegmentString*>& resultNodedSegments);
-
-    /**
-    * Creates HotPixels for each vertex in the input segStrings.
-    * The HotPixels are not marked as nodes, since they will
-    * only be nodes in the final line arrangement
-    * if they interact with other segments (or they are already
-    * created as intersection nodes).
-    */
-    void addVertexPixels(std::vector<SegmentString*>& segStrings);
-
-    /**
-    * Detects interior intersections in the collection of {@link SegmentString}s,
-    * and adds nodes for them to the segment strings.
-    * Also creates HotPixel nodes for the intersection points.
-    */
-    void addIntersectionPixels(std::vector<SegmentString*>& segStrings);
-
-    /**
-    * Gets a list of the rounded coordinates.
-    * Duplicate (collapsed) coordinates are removed.
-    *
-    * @param pts the coordinates to round
-    * @return array of rounded coordinates
-    */
-    std::unique_ptr<geom::CoordinateSequence> round(const geom::CoordinateSequence& pts) const;
-
-    /**
-    * Computes new segment strings which are rounded and contain
-    * intersections added as a result of snapping segments to snap points (hot pixels).
-    *
-    * @param segStrings segments to snap
-    * @return the snapped segment strings
-    */
-    void computeSnaps(const std::vector<SegmentString*>& segStrings, std::vector<SegmentString*>& snapped);
-    NodedSegmentString* computeSegmentSnaps(NodedSegmentString* ss);
-
-    /**
-    * Snaps a segment in a segmentString to HotPixels that it intersects.
-    *
-    * @param p0 the segment start coordinate
-    * @param p1 the segment end coordinate
-    * @param ss the segment string to add intersections to
-    * @param segIndex the index of the segment
-    */
-    void snapSegment(const geom::CoordinateXY& p0, const geom::CoordinateXY& p1, NodedSegmentString* ss, std::size_t segIndex);
-
-    /**
-    * Add nodes for any vertices in hot pixels that were
-    * added as nodes during segment noding.
-    */
-    void addVertexNodeSnaps(NodedSegmentString* ss);
-
-    void snapVertexNode(const geom::CoordinateXY& p0, NodedSegmentString* ss, std::size_t segIndex);
-
-public:
-
-    SnapRoundingNoder(const geom::PrecisionModel* p_pm)
-        : pm(p_pm)
-        , pixelIndex(p_pm)
-        {}
-
-    /**
-    * @return a Collection of NodedSegmentStrings representing the substrings
-    */
-    std::vector<SegmentString*>* getNodedSubstrings() const override;
-
-    /**
-    * Computes the nodes in the snap-rounding line arrangement.
-    * The nodes are added to the {@link NodedSegmentString}s provided as the input.
-    */
-    void computeNodes(std::vector<SegmentString*>* inputSegStrings) override; //override
-
-};
-
-
-} // namespace geos::noding::snapround
-} // namespace geos::noding
-} // namespace geos
-
-
-

package/geos.xcframework/ios-arm64_arm64e_x86_64-simulator/Headers/geos/operation/BoundaryOp.h

@@ -1,120 +0,0 @@
-/**********************************************************************
- *
- * GEOS - Geometry Engine Open Source
- * http://geos.osgeo.org
- *
- * Copyright (C) 2022 ISciences LLC
- *
- * 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.
- *
- **********************************************************************
- *
- * Last port: operation/BoundaryOp.java fd5aebb
- *
- **********************************************************************/
-
-#pragma once
-
-#include <geos/algorithm/BoundaryNodeRule.h>
-#include <geos/geom/Geometry.h>
-#include <map>
-
-namespace geos {
-namespace geom {
-class LineString;
-class MultiLineString;
-}
-}
-
-namespace geos {
-namespace operation {
-
-/**
- * Computes the boundary of a Geometry.
- * Allows specifying the BoundaryNodeRule to be used.
- * This operation will always return a Geometry of the appropriate
- * dimension for the boundary (even if the input geometry is empty).
- * The boundary of zero-dimensional geometries (Points) is
- * always the empty GeometryCollection.
- *
- * @author Martin Davis
- * @version 1.7
- */
-class GEOS_DLL BoundaryOp {
-
-public:
-  /**
-   * Creates a new instance for the given geometry.
-   *
-   * @param geom the input geometry
-   */
-  BoundaryOp(const geom::Geometry& geom);
-
-  /**
-   * Creates a new instance for the given geometry.
-   *
-   * @param geom the input geometry
-   * @param bnRule the Boundary Node Rule to use
-   */
-  BoundaryOp(const geom::Geometry& geom, const algorithm::BoundaryNodeRule& bnRule);
-
- /**
-   * Computes a geometry representing the boundary of a geometry.
-   *
-   * @param g the input geometry
-   * @return the computed boundary
-   */
-  static std::unique_ptr<geom::Geometry> getBoundary(const geom::Geometry& g);
-
-  /**
-   * Computes a geometry representing the boundary of a geometry,
-   * using an explicit BoundaryNodeRule.
-   *
-   * @param g the input geometry
-   * @param bnRule the Boundary Node Rule to use
-   * @return the computed boundary
-   */
-  static std::unique_ptr<geom::Geometry> getBoundary(const geom::Geometry& g, const algorithm::BoundaryNodeRule& bnRule);
-
-  /**
-   * Tests if a geometry has a boundary (it is non-empty).
-   * The semantics are:
-   * <ul>
-   * <li>Empty geometries do not have boundaries.
-   * <li>Points do not have boundaries.
-   * <li>For linear geometries the existence of the boundary
-   * is determined by the BoundaryNodeRule.
-   * <li>Non-empty polygons always have a boundary.
-   * </ul>
-   *
-   * @param geom the geometry providing the boundary
-   * @param boundaryNodeRule  the Boundary Node Rule to use
-   * @return true if the boundary exists
-   */
-  static bool hasBoundary(const geom::Geometry& geom, const algorithm::BoundaryNodeRule& boundaryNodeRule);
-
-  /**
-   * Gets the computed boundary.
-   *
-   * @return the boundary geometry
-   */
-  std::unique_ptr<geom::Geometry> getBoundary();
-
-private:
-  const geom::Geometry& m_geom;
-  const geom::GeometryFactory& m_geomFact;
-  const algorithm::BoundaryNodeRule& m_bnRule;
-
-  std::unique_ptr<geom::Geometry> boundaryMultiLineString(const geom::MultiLineString& mLine);
-
-  std::unique_ptr<geom::CoordinateSequence> computeBoundaryCoordinates(const geom::MultiLineString& mLine);
-
-  std::unique_ptr<geom::Geometry> boundaryLineString(const geom::LineString& line);
-};
-
-}
-}
-

package/geos.xcframework/ios-arm64_arm64e_x86_64-simulator/Headers/geos/operation/GeometryGraphOperation.h

@@ -1,92 +0,0 @@
-/**********************************************************************
- *
- * GEOS - Geometry Engine Open Source
- * http://geos.osgeo.org
- *
- * Copyright (C) 2005-2006 Refractions Research Inc.
- * Copyright (C) 2001-2002 Vivid Solutions Inc.
- *
- * 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.
- *
- **********************************************************************
- *
- * Last port: operation/GeometryGraphOperation.java rev. 1.18 (JTS-1.10)
- *
- **********************************************************************/
-
-#pragma once
-
-#include <geos/export.h>
-#include <geos/algorithm/LineIntersector.h> // for composition
-
-#include <vector>
-
-#ifdef _MSC_VER
-#pragma warning(push)
-#pragma warning(disable: 4251) // warning C4251: needs to have dll-interface to be used by clients of class
-#endif
-
-// Forward declarations
-namespace geos {
-namespace algorithm {
-class BoundaryNodeRule;
-}
-namespace geom {
-class Geometry;
-class PrecisionModel;
-}
-namespace geomgraph {
-class GeometryGraph;
-}
-}
-
-
-namespace geos {
-namespace operation { // geos.operation
-
-/// The base class for operations that require GeometryGraph
-class GEOS_DLL GeometryGraphOperation {
-
-public:
-
-    GeometryGraphOperation(const geom::Geometry* g0,
-                           const geom::Geometry* g1);
-
-    GeometryGraphOperation(const geom::Geometry* g0,
-                           const geom::Geometry* g1,
-                           const algorithm::BoundaryNodeRule& boundaryNodeRule);
-
-    GeometryGraphOperation(const geom::Geometry* g0);
-
-    virtual ~GeometryGraphOperation();
-
-    const geom::Geometry* getArgGeometry(unsigned int i) const;
-
-protected:
-
-    algorithm::LineIntersector li;
-
-    const geom::PrecisionModel* resultPrecisionModel;
-
-    /** \brief
-     * The operation args into an array so they can be accessed by index
-     */
-    std::vector<std::unique_ptr<geomgraph::GeometryGraph>> arg;
-
-    void setComputationPrecision(const geom::PrecisionModel* pm);
-
-    // Declare type as noncopyable
-    GeometryGraphOperation(const GeometryGraphOperation& other) = delete;
-    GeometryGraphOperation& operator=(const GeometryGraphOperation& rhs) = delete;
-};
-
-} // namespace geos.operation
-} // namespace geos
-
-#ifdef _MSC_VER
-#pragma warning(pop)
-#endif
-