GeometryGraph.h

/**********************************************************************
 * $Id: GeometryGraph.h 2557 2009-06-08 09:30:55Z strk $
 *
 * GEOS - Geometry Engine Open Source
 * http://geos.refractions.net
 *
 * 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 rev. 1.9 (JTS-1.10)
 *
 **********************************************************************/


#ifndef GEOS_GEOMGRAPH_GEOMETRYGRAPH_H
#define GEOS_GEOMGRAPH_GEOMETRYGRAPH_H

#include <geos/export.h>
#include <map>
#include <vector>
#include <memory>

#include <geos/geom/Coordinate.h>
#include <geos/geom/CoordinateSequence.h> // for auto_ptr<CoordinateSequence>
#include <geos/geomgraph/PlanarGraph.h>
#include <geos/geom/LineString.h> // for LineStringLT

#include <geos/inline.h>

// Forward declarations
namespace geos {
        namespace geom {
                class LineString;
                class LinearRing;
                class Polygon;
                class Geometry;
                class GeometryCollection;
                class Point;
        }
        namespace algorithm {
                class LineIntersector;
                class BoundaryNodeRule;
        }
        namespace geomgraph {
                class Edge;
                class Node;
                namespace index {
                        class SegmentIntersector;
                        class EdgeSetIntersector;
                }
        }
}

namespace geos {
namespace geomgraph { // geos.geomgraph

class GEOS_DLL GeometryGraph: public PlanarGraph
{
using PlanarGraph::add;
using PlanarGraph::findEdge;

private:

        const geom::Geometry* parentGeom;

//std::map<const geom::LineString*,Edge*,geom::LineStringLT> lineEdgeMap;
        std::map<const geom::LineString*, Edge*> lineEdgeMap;

        bool useBoundaryDeterminationRule;

        const algorithm::BoundaryNodeRule& boundaryNodeRule;

        int argIndex;

        std::auto_ptr< geom::CoordinateSequence > boundaryPoints;

        std::auto_ptr< std::vector<Node*> > boundaryNodes;

        bool hasTooFewPointsVar;

        geom::Coordinate invalidPoint; 

        std::vector<index::SegmentIntersector*> newSegmentIntersectors;

        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,
                        int cwLeft, int cwRight);

        void addPolygon(const geom::Polygon *p);

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

        void insertPoint(int argIndex, const geom::Coordinate& coord,
                        int onLocation);

        void insertBoundaryPoint(int argIndex, const geom::Coordinate& coord);

        void addSelfIntersectionNodes(int argIndex);

        void addSelfIntersectionNode(int argIndex,
                const geom::Coordinate& coord, int loc);

public:

        static bool isInBoundary(int boundaryCount);

        static int determineBoundary(int boundaryCount);

        static int determineBoundary(
                     const algorithm::BoundaryNodeRule& boundaryNodeRule,
                                                    int boundaryCount);

        GeometryGraph();

        GeometryGraph(int newArgIndex, const geom::Geometry *newParentGeom);

        GeometryGraph(int newArgIndex, const geom::Geometry *newParentGeom,
                      const algorithm::BoundaryNodeRule& boundaryNodeRule);

        virtual ~GeometryGraph();


        const geom::Geometry* getGeometry();

        std::vector<Node*>* getBoundaryNodes();

        void getBoundaryNodes(std::vector<Node*>&bdyNodes);

        geom::CoordinateSequence* getBoundaryPoints();

        Edge* findEdge(const geom::LineString *line);

        void computeSplitEdges(std::vector<Edge*> *edgelist);

        void addEdge(Edge *e);

        void addPoint(geom::Coordinate& pt);

        index::SegmentIntersector* computeSelfNodes(
                        algorithm::LineIntersector *li,
                        bool computeRingSelfNodes);

        // Quick inline calling the function above, the above should probably
        // be deprecated.
        index::SegmentIntersector* computeSelfNodes(
                        algorithm::LineIntersector& li,
                        bool computeRingSelfNodes);

        index::SegmentIntersector* computeEdgeIntersections(GeometryGraph *g,
                algorithm::LineIntersector *li, bool includeProper);

        std::vector<Edge*> *getEdges();

        bool hasTooFewPoints();

        const geom::Coordinate& getInvalidPoint(); 

        const algorithm::BoundaryNodeRule& getBoundaryNodeRule() const
        { return boundaryNodeRule; }

};


} // namespace geos.geomgraph
} // namespace geos

#ifdef GEOS_INLINE
# include "geos/geomgraph/GeometryGraph.inl"
#endif

#endif // ifndef GEOS_GEOMGRAPH_GEOMETRYGRAPH_H

/**********************************************************************
 * $Log$
 * Revision 1.4  2006/06/13 22:00:26  strk
 * Changed GeometryGraph::lineEdgeMap set comparison function to be pointer-based. Should be safe and much faster. Available tests all succeed.
 *
 * Revision 1.3  2006/03/29 15:23:49  strk
 * Moved GeometryGraph inlines from .h to .inl file
 *
 * Revision 1.2  2006/03/24 09:52:41  strk
 * USE_INLINE => GEOS_INLINE
 *
 * Revision 1.1  2006/03/09 16:46:49  strk
 * geos::geom namespace definition, first pass at headers split
 *
 **********************************************************************/

---