RelateComputer.h

/**********************************************************************
 *
 * GEOS - Geometry Engine Open Source
 * http://geos.osgeo.org
 *
 * Copyright (C) 2011 Sandro Santilli <strk@kbt.io>
 * 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/relate/RelateComputer.java rev. 1.24 (JTS-1.10)
 *
 **********************************************************************/
 
#pragma once
 
#include <geos/export.h>
 
#include <geos/algorithm/PointLocator.h> // for RelateComputer composition
#include <geos/algorithm/LineIntersector.h> // for RelateComputer composition
#include <geos/geomgraph/NodeMap.h> // for RelateComputer composition
#include <geos/geom/Coordinate.h> // for RelateComputer composition
#include <geos/geom/IntersectionMatrix.h>
 
#include <vector>
#include <memory>
 
#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;
}
namespace geomgraph {
class GeometryGraph;
class Edge;
class EdgeEnd;
class Node;
namespace index {
class SegmentIntersector;
}
}
}
 
 
namespace geos {
namespace operation { // geos::operation
namespace relate { // geos::operation::relate
 
class GEOS_DLL RelateComputer {
public:
    RelateComputer(std::vector<geomgraph::GeometryGraph*>* newArg);
    ~RelateComputer() = default;
 
    std::unique_ptr<geom::IntersectionMatrix> computeIM();
private:
 
    algorithm::LineIntersector li;
 
    algorithm::PointLocator ptLocator;
 
    std::vector<geomgraph::GeometryGraph*>* arg;
 
    geomgraph::NodeMap nodes;
 
    std::unique_ptr<geom::IntersectionMatrix> im;
 
    std::vector<geomgraph::Edge*> isolatedEdges;
 
    geom::Coordinate invalidPoint;
 
    void insertEdgeEnds(std::vector<geomgraph::EdgeEnd*>* ee);
 
    void computeProperIntersectionIM(
        geomgraph::index::SegmentIntersector* intersector,
        geom::IntersectionMatrix* imX);
 
    void copyNodesAndLabels(uint8_t argIndex);
    void computeIntersectionNodes(uint8_t argIndex);
    void labelIntersectionNodes(uint8_t argIndex);
 
    void computeDisjointIM(geom::IntersectionMatrix* imX,
                           const algorithm::BoundaryNodeRule& boundaryNodeRule);
 
    void labelNodeEdges();
 
    void updateIM(geom::IntersectionMatrix& imX);
 
    static int getBoundaryDim(const geom::Geometry& geom,
                              const algorithm::BoundaryNodeRule& boundaryNodeRule);
 
    void labelIsolatedEdges(uint8_t thisIndex, uint8_t targetIndex);
 
    void labelIsolatedEdge(geomgraph::Edge* e, uint8_t targetIndex,
                           const geom::Geometry* target);
 
    void labelIsolatedNodes();
 
    void labelIsolatedNode(geomgraph::Node* n, uint8_t targetIndex);
};
 
 
} // namespace geos:operation:relate
} // namespace geos:operation
} // namespace geos
 
#ifdef _MSC_VER
#pragma warning(pop)
#endif