PolygonizeGraph.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/PolygonizeGraph.java rev. 6/138 (JTS-1.10)
 *
 **********************************************************************/
 
#ifndef GEOS_OP_POLYGONIZE_POLYGONIZEGRAPH_H
#define GEOS_OP_POLYGONIZE_POLYGONIZEGRAPH_H
 
#include <geos/export.h>
 
#include <geos/planargraph/PlanarGraph.h> // for inheritance
 
#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 geom { 
                class LineString;
                class GeometryFactory;
                class Coordinate;
                class CoordinateSequence;
        }
        namespace planargraph { 
                class Node;
                class Edge;
                class DirectedEdge;
        }
        namespace operation { 
                namespace polygonize {
                        class EdgeRing;
                        class PolygonizeDirectedEdge;
                }
        }
}
 
namespace geos {
namespace operation { // geos::operation
namespace polygonize { // geos::operation::polygonize
 

class GEOS_DLL PolygonizeGraph: public planargraph::PlanarGraph {
 
public:

        static void deleteAllEdges(planargraph::Node *node);

        PolygonizeGraph(const geom::GeometryFactory *newFactory);

        ~PolygonizeGraph();

        void addEdge(const geom::LineString *line);

        void getEdgeRings(std::vector<EdgeRing*>& edgeRingList);

        void deleteCutEdges(std::vector<const geom::LineString*> &cutLines);

        void deleteDangles(std::vector<const geom::LineString*> &dangleLines);
 
private:
 
        static int getDegreeNonDeleted(planargraph::Node *node);
 
        static int getDegree(planargraph::Node *node, long label);
 
        const geom::GeometryFactory *factory;
 
        planargraph::Node* getNode(const geom::Coordinate& pt);
 
        void computeNextCWEdges();

        void convertMaximalToMinimalEdgeRings(
                        std::vector<PolygonizeDirectedEdge*> &ringEdges);

        static void findIntersectionNodes( PolygonizeDirectedEdge *startDE,
                        long label, std::vector<planargraph::Node*>& intNodes
);

        static void findLabeledEdgeRings(
                        std::vector<planargraph::DirectedEdge*> &dirEdgesIn,
                        std::vector<PolygonizeDirectedEdge*> &dirEdgesOut);
 
        static void label(std::vector<planargraph::DirectedEdge*> &dirEdges, long label);
 
        static void computeNextCWEdges(planargraph::Node *node);

        static void computeNextCCWEdges(planargraph::Node *node, long label);

        static void findDirEdgesInRing(PolygonizeDirectedEdge *startDE,
                std::vector<planargraph::DirectedEdge*>& edgesInRing);
 
        EdgeRing* findEdgeRing(PolygonizeDirectedEdge *startDE);
 
        /* Tese are for memory management */
        std::vector<planargraph::Edge *> newEdges;
        std::vector<planargraph::DirectedEdge *> newDirEdges;
        std::vector<planargraph::Node *> newNodes;
        std::vector<EdgeRing *> newEdgeRings;
        std::vector<geom::CoordinateSequence *> newCoords;
};
 
} // namespace geos::operation::polygonize
} // namespace geos::operation
} // namespace geos
 
#ifdef _MSC_VER
#pragma warning(pop)
#endif
 
#endif // GEOS_OP_POLYGONIZE_POLYGONIZEGRAPH_H