@cpp.js/package-geos 1.0.0-beta.22 → 1.0.0

package/dist/prebuilt/Android-x86_64/include/geos/operation/buffer/BufferInputLineSimplifier.h

@@ -0,0 +1,180 @@
+/**********************************************************************
+ *
+ * GEOS - Geometry Engine Open Source
+ * http://geos.osgeo.org
+ *
+ * Copyright (C) 2009  Sandro Santilli <strk@kbt.io>
+ *
+ * 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/buffer/BufferInputLineSimplifier.java r320 (JTS-1.12)
+ *
+ **********************************************************************/
+
+#pragma once
+
+#include <geos/geom/CoordinateSequence.h> // complete type required
+
+#include <memory>
+#include <vector> // for composition
+
+
+// Forward declarations
+namespace geos {
+namespace geom {
+class CoordinateSequence;
+//class PrecisionModel;
+}
+}
+
+namespace geos {
+namespace operation { // geos.operation
+namespace buffer { // geos.operation.buffer
+
+/** \brief
+ * Simplifies a buffer input line to
+ * remove concavities with shallow depth.
+ *
+ * The most important benefit of doing this
+ * is to reduce the number of points and the complexity of
+ * shape which will be buffered.
+ * It also reduces the risk of gores created by
+ * the quantized fillet arcs (although this issue
+ * should be eliminated in any case by the
+ * offset curve generation logic).
+ *
+ * A key aspect of the simplification is that it
+ * affects inside (concave or inward) corners only.
+ * Convex (outward) corners are preserved, since they
+ * are required to ensure that the generated buffer curve
+ * lies at the correct distance from the input geometry.
+ *
+ * Another important heuristic used is that the end segments
+ * of the input are never simplified.  This ensures that
+ * the client buffer code is able to generate end caps faithfully.
+ *
+ * No attempt is made to avoid self-intersections in the output.
+ * This is acceptable for use for generating a buffer offset curve,
+ * since the buffer algorithm is insensitive to invalid polygonal
+ * geometry.  However,
+ * this means that this algorithm
+ * cannot be used as a general-purpose polygon simplification technique.
+ *
+ * @author Martin Davis
+ *
+ */
+class BufferInputLineSimplifier {
+
+public:
+
+    /**
+     * Simplify the input coordinate list.
+     *
+     * If the distance tolerance is positive,
+     * concavities on the LEFT side of the line are simplified.
+     * If the supplied distance tolerance is negative,
+     * concavities on the RIGHT side of the line are simplified.
+     *
+     * @param inputLine the coordinate sequence to simplify
+     * @param distanceTol simplification distance tolerance to use
+     * @return a simplified version of the coordinate sequence
+     */
+    static std::unique_ptr<geom::CoordinateSequence> simplify(
+        const geom::CoordinateSequence& inputLine, double distanceTol);
+
+    BufferInputLineSimplifier(const geom::CoordinateSequence& input);
+
+    /**
+     * Simplify the input coordinate list.
+     * If the distance tolerance is positive,
+     * concavities on the LEFT side of the line are simplified.
+     * If the supplied distance tolerance is negative,
+     * concavities on the RIGHT side of the line are simplified.
+     *
+     * @param distanceTol simplification distance tolerance to use
+     * @return the simplified coordinate list
+     */
+    std::unique_ptr<geom::CoordinateSequence> simplify(double distanceTol);
+
+private:
+
+    /**
+     * Uses a sliding window containing 3 vertices to detect shallow angles
+     * in which the middle vertex can be deleted, since it does not
+     * affect the shape of the resulting buffer in a significant way.
+     * @return
+     */
+    bool deleteShallowConcavities();
+
+    /**
+     * Finds the next non-deleted index,
+     * or the end of the point array if none
+     *
+     * @param index
+     * @return the next non-deleted index, if any
+     * @return inputLine.size() if there are no more non-deleted indices
+     */
+    std::size_t findNextNonDeletedIndex(std::size_t index) const;
+
+    std::unique_ptr<geom::CoordinateSequence> collapseLine() const;
+
+    bool isDeletable(std::size_t i0, std::size_t i1, std::size_t i2, double distanceTol) const;
+
+    bool isShallowConcavity(const geom::Coordinate& p0,
+                            const geom::Coordinate& p1,
+                            const geom::Coordinate& p2,
+                            double distanceTol) const;
+
+    /**
+     * Checks for shallowness over a sample of points in the given section.
+     *
+     * This helps prevents the simplification from incrementally
+     * "skipping" over points which are in fact non-shallow.
+     *
+     * @param p0 start coordinate of section
+     * @param p2 end coordinate of section
+     * @param i0 start index of section
+     * @param i2 end index of section
+     * @param distanceTol distance tolerance
+     * @return
+     */
+    bool isShallowSampled(const geom::Coordinate& p0,
+                          const geom::Coordinate& p2,
+                          std::size_t i0, std::size_t i2, double distanceTol) const;
+
+    bool isShallow(const geom::Coordinate& p0,
+                   const geom::Coordinate& p1,
+                   const geom::Coordinate& p2,
+                   double distanceTol) const;
+
+    bool isConcave(const geom::Coordinate& p0,
+                   const geom::Coordinate& p1,
+                   const geom::Coordinate& p2) const;
+
+    static const int NUM_PTS_TO_CHECK = 10;
+
+    static const int INIT = 0;
+    static const int DELETE = 1;
+    static const int KEEP = 1;
+
+    const geom::CoordinateSequence& inputLine;
+    double distanceTol;
+    std::vector<int> isDeleted;
+
+    int angleOrientation;
+
+    // Declare type as noncopyable
+    BufferInputLineSimplifier(const BufferInputLineSimplifier& other) = delete;
+    BufferInputLineSimplifier& operator=(const BufferInputLineSimplifier& rhs) = delete;
+};
+
+
+} // namespace geos.operation.buffer
+} // namespace geos.operation
+} // namespace geos
+

package/dist/prebuilt/Android-x86_64/include/geos/operation/buffer/BufferOp.h

@@ -0,0 +1,307 @@
+/**********************************************************************
+ *
+ * GEOS - Geometry Engine Open Source
+ * http://geos.osgeo.org
+ *
+ * Copyright (C) 2009-2011 Sandro Santilli <strk@kbt.io>
+ * Copyright (C) 2005-2007 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/buffer/BufferOp.java r378 (JTS-1.12)
+ *
+ **********************************************************************/
+
+#pragma once
+
+#include <memory> // for unique_ptr
+#include <vector> // for vector
+
+#include <geos/export.h>
+#include <geos/operation/buffer/BufferParameters.h> // for enum values
+#include <geos/geom/Geometry.h> // to materialize Geometry
+
+#include <geos/util/TopologyException.h> // for composition
+
+#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 geom {
+class PrecisionModel;
+class Geometry;
+}
+}
+
+namespace geos {
+namespace operation { // geos.operation
+namespace buffer { // geos.operation.buffer
+
+/**
+ * \class BufferOp
+ *
+ * \brief
+ * Computes the buffer of a geometry, for both positive and negative
+ * buffer distances.
+ *
+ * In GIS, the positive (or negative) buffer of a geometry is defined as
+ * the Minkowski sum (or difference) of the geometry
+ * with a circle with radius equal to the absolute value of the buffer
+ * distance.
+ * In the CAD/CAM world buffers are known as *offset curves*.
+ * In morphological analysis the operation of positive and negative buffering
+ * is referred to as *erosion* and *dilation*.
+ *
+ * The buffer operation always returns a polygonal result.
+ * The negative or zero-distance buffer of lines and points is always
+ * an empty Polygon.
+ *
+ * Since true buffer curves may contain circular arcs,
+ * computed buffer polygons can only be approximations to the true geometry.
+ * The user can control the accuracy of the curve approximation by specifying
+ * the number of linear segments with which to approximate a curve.
+ *
+ * The end cap style of a linear buffer may be specified.
+ * The following end cap styles are supported:
+ * - CAP_ROUND - the usual round end caps
+ * - CAP_BUTT - end caps are truncated flat at the line ends
+ * - CAP_SQUARE - end caps are squared off at the buffer distance
+ *   beyond the line ends
+ *
+ */
+class GEOS_DLL BufferOp {
+
+
+private:
+
+    /** \brief
+     *  A number of digits of precision which leaves some computational "headroom"
+     *  for floating point operations.
+     *
+     *  This value should be less than the decimal precision of double-precision values (16).
+     */
+    static constexpr int MAX_PRECISION_DIGITS = 12;
+
+    const geom::Geometry* argGeom;
+
+    util::TopologyException saveException;
+
+    double distance;
+
+    BufferParameters bufParams;
+
+    std::unique_ptr<geom::Geometry> resultGeometry;
+
+    bool isInvertOrientation = false;
+
+    /**
+     * Compute a reasonable scale factor to limit the precision of
+     * a given combination of Geometry and buffer distance.
+     * The scale factor is based on a heuristic.
+     *
+     * @param g the Geometry being buffered
+     *
+     * @param distance the buffer distance
+     *
+     * @param maxPrecisionDigits the mzx # of digits that should be
+     *        allowed by the precision determined by the
+     *        computed scale factor
+     *
+     * @return a scale factor that allows a reasonable amount of
+     *         precision for the buffer computation
+     */
+    static double precisionScaleFactor(const geom::Geometry* g,
+                                       double distance, int maxPrecisionDigits);
+
+
+    void computeGeometry();
+
+    void bufferOriginalPrecision();
+
+    void bufferReducedPrecision(int precisionDigits);
+
+    void bufferReducedPrecision();
+
+    void bufferFixedPrecision(const geom::PrecisionModel& fixedPM);
+
+    static void extractPolygons(
+        geom::Geometry* poly0,
+        std::vector<std::unique_ptr<geom::Geometry>>& polys);
+
+public:
+
+    enum {
+        /// Specifies a round line buffer end cap style.
+        /// @deprecated use BufferParameters
+        CAP_ROUND = BufferParameters::CAP_ROUND,
+
+        /// Specifies a butt (or flat) line buffer end cap style.
+        /// @deprecated use BufferParameters
+        CAP_BUTT = BufferParameters::CAP_FLAT,
+
+        /// Specifies a square line buffer end cap style.
+        /// @deprecated use BufferParameters
+        CAP_SQUARE = BufferParameters::CAP_SQUARE
+    };
+
+    /** \brief
+     * Computes the buffer for a geometry for a given buffer distance
+     * and accuracy of approximation.
+     *
+     * @param g the geometry to buffer
+     * @param distance the buffer distance
+     * @param quadrantSegments the number of segments used to
+     *        approximate a quarter circle
+     * @param endCapStyle line buffer end cap style (default: BufferParameters::CAP_ROUND)
+     * @return the buffer of the input geometry
+     *
+     */
+    static std::unique_ptr<geom::Geometry> bufferOp(
+        const geom::Geometry* g,
+        double distance,
+        int quadrantSegments = BufferParameters::DEFAULT_QUADRANT_SEGMENTS,
+        int endCapStyle = BufferParameters::CAP_ROUND);
+
+    static std::unique_ptr<geom::Geometry> bufferOp(
+        const geom::Geometry* g,
+        double distance,
+        BufferParameters& bufParms);
+
+    /** \brief
+     * Initializes a buffer computation for the given geometry.
+     *
+     * @param g the geometry to buffer
+     */
+    BufferOp(const geom::Geometry* g)
+        :
+        argGeom(g),
+        bufParams(),
+        resultGeometry(nullptr),
+        isInvertOrientation(false)
+    {
+    }
+
+    /** \brief
+     * Initializes a buffer computation for the given geometry
+     * with the given set of parameters.
+     *
+     * @param g the geometry to buffer
+     * @param params the buffer parameters to use. This class will
+     *               copy it to private memory.
+     */
+    BufferOp(const geom::Geometry* g, const BufferParameters& params)
+        :
+        argGeom(g),
+        bufParams(params),
+        resultGeometry(nullptr),
+        isInvertOrientation(false)
+    {
+    }
+
+    /** \brief
+     * Specifies the end cap style of the generated buffer.
+     *
+     * The styles supported are CAP_ROUND, CAP_BUTT, and CAP_SQUARE.
+     * The default is CAP_ROUND.
+     *
+     * @param nEndCapStyle the end cap style to specify
+     */
+    inline void setEndCapStyle(int nEndCapStyle);
+
+    /** \brief
+     * Sets the number of segments used to approximate a angle fillet
+     *
+     * @param nQuadrantSegments the number of segments in a fillet for a quadrant
+     */
+    inline void setQuadrantSegments(int nQuadrantSegments);
+
+    /** \brief
+     * Sets whether the computed buffer should be single-sided.
+     *
+     * A single-sided buffer is constructed on only one side
+     * of each input line.
+     *
+     * The side used is determined by the sign of the buffer distance:
+     * - a positive distance indicates the left-hand side
+     * - a negative distance indicates the right-hand side
+     *
+     * The single-sided buffer of point geometries is
+     * the same as the regular buffer.
+     *
+     * The End Cap Style for single-sided buffers is
+     * always ignored,
+     * and forced to the equivalent of `CAP_FLAT`.
+     *
+     * @param isSingleSided `true` if a single-sided buffer
+     *                      should be constructed
+     */
+    inline void setSingleSided(bool isSingleSided);
+
+    /** \brief
+     * Returns the buffer computed for a geometry for a given buffer
+     * distance.
+     *
+     * @param nDistance the buffer distance
+     * @return the buffer of the input geometry
+     */
+    std::unique_ptr<geom::Geometry> getResultGeometry(double nDistance);
+
+    /**
+    * Buffers a geometry with distance zero.
+    * The result can be computed using the maximum-signed-area orientation,
+    * or by combining both orientations.
+    *
+    * This can be used to fix an invalid polygonal geometry to be valid
+    * (i.e. with no self-intersections).
+    * For some uses (e.g. fixing the result of a simplification)
+    * a better result is produced by using only the max-area orientation.
+    * Other uses (e.g. fixing geometry) require both orientations to be used.
+    *
+    * This function is for INTERNAL use only.
+    *
+    * @param geom the polygonal geometry to buffer by zero
+    * @param isBothOrientations true if both orientations of input rings should be used
+    * @return the buffered polygonal geometry
+    */
+    static std::unique_ptr<geom::Geometry> bufferByZero(
+        const geom::Geometry* geom,
+        bool isBothOrientations);
+
+};
+
+// BufferOp inlines
+void
+BufferOp::setQuadrantSegments(int q)
+{
+    bufParams.setQuadrantSegments(q);
+}
+
+void
+BufferOp::setEndCapStyle(int s)
+{
+    bufParams.setEndCapStyle((BufferParameters::EndCapStyle)s);
+}
+
+void
+BufferOp::setSingleSided(bool isSingleSided)
+{
+    bufParams.setSingleSided(isSingleSided);
+}
+
+} // namespace geos::operation::buffer
+} // namespace geos::operation
+} // namespace geos
+
+#ifdef _MSC_VER
+#pragma warning(pop)
+#endif
+