IntersectionAdder.h

/**********************************************************************
 *
 * GEOS - Geometry Engine Open Source
 * http://geos.osgeo.org
 *
 * Copyright (C) 2006      Refractions Research 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: noding/IntersectionAdder.java rev. 1.6 (JTS-1.9)
 *
 **********************************************************************/
 
#ifndef GEOS_NODING_INTERSECTIONADDER_H
#define GEOS_NODING_INTERSECTIONADDER_H
 
#include <geos/export.h>
 
#include <vector>
#include <iostream>
#include <cstdlib> // for abs()
 
#include <geos/inline.h>
 
#include <geos/geom/Coordinate.h>
#include <geos/noding/SegmentIntersector.h> // for inheritance
 
// Forward declarations
namespace geos {
        namespace geom {
                class Coordinate;
        }
        namespace noding {
                class SegmentString;
        }
        namespace algorithm {
                class LineIntersector;
        }
}
 
namespace geos {
namespace noding { // geos.noding

class GEOS_DLL IntersectionAdder: public SegmentIntersector {
 
private:

        bool hasIntersectionVar;
        bool hasProper;
        bool hasProperInterior;
        bool hasInterior;
 
        // the proper intersection point found
        const geom::Coordinate* properIntersectionPoint;
 
        algorithm::LineIntersector& li;
        bool isSelfIntersection;
        //bool intersectionFound;

        bool isTrivialIntersection(const SegmentString* e0, int segIndex0,
                        const SegmentString* e1, int segIndex1);
 
    // Declare type as noncopyable
    IntersectionAdder(const IntersectionAdder& other);
    IntersectionAdder& operator=(const IntersectionAdder& rhs);
 
public:
 
        int numIntersections;
        int numInteriorIntersections;
        int numProperIntersections;
 
        // testing only
        int numTests;
 
        IntersectionAdder(algorithm::LineIntersector& newLi)
                :
                hasIntersectionVar(false),
                hasProper(false),
                hasProperInterior(false),
                hasInterior(false),
                properIntersectionPoint(NULL),
                li(newLi),
                numIntersections(0),
                numInteriorIntersections(0),
                numProperIntersections(0),
                numTests(0)
        {}
 
        algorithm::LineIntersector& getLineIntersector() { return li; }

        const geom::Coordinate* getProperIntersectionPoint()  {
                return properIntersectionPoint;
        }
 
        bool hasIntersection() { return hasIntersectionVar; }

        bool hasProperIntersection() { return hasProper; }

        bool hasProperInteriorIntersection() { return hasProperInterior; }

        bool hasInteriorIntersection() { return hasInterior; }
 

        void processIntersections(
                SegmentString* e0,  int segIndex0,
                SegmentString* e1,  int segIndex1);
 
 
        static bool isAdjacentSegments(int i1, int i2) {
                return std::abs(i1 - i2) == 1;
        }

        virtual bool isDone() const {
                return false;
        }
};
 
 
} // namespace geos.noding
} // namespace geos
 
#endif // GEOS_NODING_INTERSECTIONADDER_H