operation/polygonize/EdgeRing.h

/**********************************************************************
 *
 * GEOS - Geometry Engine Open Source
 * http://geos.osgeo.org
 *
 * Copyright (C) 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/polygonize/EdgeRing.java 0b3c7e3eb0d3e
 *
 **********************************************************************/
 
#pragma once
 
#include <geos/export.h>
#include <geos/algorithm/locate/IndexedPointInAreaLocator.h>
#include <geos/operation/polygonize/PolygonizeDirectedEdge.h>
#include <geos/geom/Geometry.h>
#include <geos/geom/LinearRing.h>
#include <geos/geom/Polygon.h>
 
#include <memory>
#include <vector>
#include <geos/geom/Location.h>
 
#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 LineString;
class CoordinateSequence;
class GeometryFactory;
class Coordinate;
}
namespace planargraph {
class DirectedEdge;
}
}
 
namespace geos {
namespace operation { // geos::operation
namespace polygonize { // geos::operation::polygonize
 
class GEOS_DLL EdgeRing {
private:
    const geom::GeometryFactory* factory;
 
    typedef std::vector<const PolygonizeDirectedEdge*> DeList;
    DeList deList;
 
    // cache the following data for efficiency
    mutable std::unique_ptr<geom::LinearRing> ring;
    mutable std::shared_ptr<geom::CoordinateSequence> ringPts;
    mutable std::unique_ptr<algorithm::locate::PointOnGeometryLocator> ringLocator;
 
    std::unique_ptr<std::vector<std::unique_ptr<geom::LinearRing>>> holes;
 
    EdgeRing* shell = nullptr;
    bool is_hole;
    bool is_valid = false;
    bool is_processed = false;
    bool is_included_set = false;
    bool is_included = false;
    bool visitedByUpdateIncludedRecursive = false;
 
    const geom::CoordinateSequence* getCoordinates() const;
 
    const geom::Envelope& getEnvelope() const {
        return *getRingInternal()->getEnvelopeInternal();
    }
 
    static void addEdge(const geom::CoordinateSequence* coords,
                        bool isForward,
                        geom::CoordinateSequence* coordList);
 
    algorithm::locate::PointOnGeometryLocator* getLocator() const {
        if (ringLocator == nullptr) {
            ringLocator.reset(new algorithm::locate::IndexedPointInAreaLocator(*getRingInternal()));
        }
        return ringLocator.get();
    }
 
    bool contains(const EdgeRing& otherRing) const;
    bool isPointInOrOut(const EdgeRing& otherRing) const;
 
public:
    void add(const PolygonizeDirectedEdge* de);
 
    EdgeRing* findEdgeRingContaining(const std::vector<EdgeRing*> & erList);
 
    static std::vector<PolygonizeDirectedEdge*> findDirEdgesInRing(PolygonizeDirectedEdge* startDE);
 
    static const geom::Coordinate& ptNotInList(
        const geom::CoordinateSequence* testPts,
        const geom::CoordinateSequence* pts);
 
    static bool isInList(const geom::Coordinate& pt,
                         const geom::CoordinateSequence* pts);
 
    explicit EdgeRing(const geom::GeometryFactory* newFactory);
 
    ~EdgeRing() = default;
 
    void build(PolygonizeDirectedEdge* startDE);
 
    void computeHole();
 
    const DeList& getEdges() const {
        return deList;
    }
 
    bool isHole() const {
        return is_hole;
    }
 
    /* Indicates whether we know if the ring should be included in a polygonizer
     * output of only polygons.
     */
    bool isIncludedSet() const {
        return is_included_set;
    }
 
    /* Indicates whether the ring should be included in a polygonizer output of
     * only polygons.
     */
    bool isIncluded() const {
        return is_included;
    }
 
    void setIncluded(bool included) {
        is_included = included;
        is_included_set = true;
    }
 
    bool isProcessed() const {
        return is_processed;
    }
 
    void setProcessed(bool processed) {
        is_processed = processed;
    }
 
    void setShell(EdgeRing* shellRing) {
        shell = shellRing;
    }
 
    bool hasShell() const {
        return shell != nullptr;
    }
 
    EdgeRing* getShell() {
        return isHole() ? shell : this;
    }
 
    bool isOuterHole() const {
        if (!isHole()) {
            return false;
        }
 
        return !hasShell();
    }
 
    bool isOuterShell() const {
        return getOuterHole() != nullptr;
    }
 
    EdgeRing* getOuterHole() const;
 
    void updateIncludedRecursive();
 
    void addHole(geom::LinearRing* hole);
 
    void addHole(EdgeRing* holeER);
 
    std::unique_ptr<geom::Polygon> getPolygon();
 
    bool isValid() const;
 
    void computeValid();
 
    std::unique_ptr<geom::LineString> getLineString();
 
    const geom::LinearRing* getRingInternal() const;
 
    std::unique_ptr<geom::LinearRing> getRingOwnership();
 
    geom::Location locate(const geom::CoordinateXY& pt) const {
        return getLocator()->locate(&pt);
    }
};
 
} // namespace geos::operation::polygonize
} // namespace geos::operation
} // namespace geos
 
#ifdef _MSC_VER
#pragma warning(pop)
#endif