GeometryGraph.h

/**********************************************************************
 *
 * GEOS - Geometry Engine Open Source
 * http://geos.osgeo.org
 *
 * Copyright (C) 2011 Sandro Santilli <strk@kbt.io>
 * 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: geomgraph/GeometryGraph.java r428 (JTS-1.12+)
 *
 **********************************************************************/
 
 
#pragma once
 
#include <geos/export.h>
#include <map>
#include <unordered_map>
#include <vector>
#include <memory>
 
#include <geos/geom/Coordinate.h>
#include <geos/geom/CoordinateSequence.h> // for unique_ptr<CoordinateSequence>
#include <geos/geomgraph/PlanarGraph.h>
#include <geos/geomgraph/index/SegmentIntersector.h>
#include <geos/geom/LineString.h> // for LineStringLT
 
#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 LinearRing;
class Polygon;
class Geometry;
class GeometryCollection;
class Point;
class Envelope;
}
namespace algorithm {
class LineIntersector;
class BoundaryNodeRule;
}
namespace geomgraph {
class Edge;
class Node;
namespace index {
class EdgeSetIntersector;
}
}
}
 
namespace geos {
namespace geomgraph { // geos.geomgraph
 
class GEOS_DLL GeometryGraph final: public PlanarGraph {
    using PlanarGraph::add;
    using PlanarGraph::findEdge;
 
private:
 
    const geom::Geometry* parentGeom;
 
    std::unordered_map<const geom::LineString*, Edge*> lineEdgeMap;
 
    bool useBoundaryDeterminationRule;
 
    const algorithm::BoundaryNodeRule& boundaryNodeRule;
 
    uint8_t argIndex;
 
    std::unique_ptr< geom::CoordinateSequence > boundaryPoints;
 
    std::unique_ptr< std::vector<Node*> > boundaryNodes;
 
    bool hasTooFewPointsVar;
 
    geom::Coordinate invalidPoint;
 
    index::EdgeSetIntersector* createEdgeSetIntersector();
 
    void add(const geom::Geometry* g);
    // throw(UnsupportedOperationException);
 
    void addCollection(const geom::GeometryCollection* gc);
 
    void addPoint(const geom::Point* p);
 
    void addPolygonRing(const geom::LinearRing* lr,
                        geom::Location cwLeft, geom::Location cwRight);
 
    void addPolygon(const geom::Polygon* p);
 
    void addLineString(const geom::LineString* line);
 
    void insertPoint(uint8_t p_argIndex, const geom::Coordinate& coord,
                     geom::Location onLocation);
 
    void insertBoundaryPoint(uint8_t p_argIndex, const geom::Coordinate& coord);
 
    void addSelfIntersectionNodes(uint8_t p_argIndex);
 
    void addSelfIntersectionNode(uint8_t p_argIndex,
                                 const geom::Coordinate& coord, geom::Location loc);
 
    // Declare type as noncopyable
    GeometryGraph(const GeometryGraph& other) = delete;
    GeometryGraph& operator=(const GeometryGraph& rhs) = delete;
 
public:
 
    static bool isInBoundary(int boundaryCount);
 
    static geom::Location determineBoundary(int boundaryCount);
 
    static geom::Location determineBoundary(
        const algorithm::BoundaryNodeRule& boundaryNodeRule,
        int boundaryCount);
 
    GeometryGraph(uint8_t newArgIndex, const geom::Geometry* newParentGeom);
 
    GeometryGraph(uint8_t newArgIndex, const geom::Geometry* newParentGeom,
                  const algorithm::BoundaryNodeRule& boundaryNodeRule);
 
    ~GeometryGraph() override {};
 
    const geom::Geometry* getGeometry()
    {
        return parentGeom;
    };
 
    void getBoundaryNodes(std::vector<Node*>& bdyNodes)
    {
        nodes->getBoundaryNodes(static_cast<uint8_t>(argIndex), bdyNodes);
    };
 
    std::vector<Node*>* getBoundaryNodes();
 
    geom::CoordinateSequence* getBoundaryPoints();
 
    Edge* findEdge(const geom::LineString* line) const;
 
    void computeSplitEdges(std::vector<Edge*>* edgelist);
 
    void addEdge(Edge* e);
 
    void addPoint(geom::Coordinate& pt);
 
    std::unique_ptr<index::SegmentIntersector>
    computeSelfNodes(
        algorithm::LineIntersector* li,
        bool computeRingSelfNodes,
        const geom::Envelope* env = nullptr)
    {
        return computeSelfNodes(*li, computeRingSelfNodes, env);
    }
 
    // Quick inline calling the function above, the above should probably
    // be deprecated.
    std::unique_ptr<index::SegmentIntersector> computeSelfNodes(
        algorithm::LineIntersector& li,
        bool computeRingSelfNodes, const geom::Envelope* env = nullptr);
 
    std::unique_ptr<index::SegmentIntersector> computeEdgeIntersections(GeometryGraph* g,
            algorithm::LineIntersector* li, bool includeProper,
            const geom::Envelope* env = nullptr);
 
    std::vector<Edge*>* getEdges();
 
    bool hasTooFewPoints();
 
    const geom::Coordinate& getInvalidPoint();
 
    const algorithm::BoundaryNodeRule&
    getBoundaryNodeRule() const
    {
        return boundaryNodeRule;
    }
 
};
 
 
} // namespace geos.geomgraph
} // namespace geos
 
#ifdef _MSC_VER
#pragma warning(pop)
#endif