src/noding/IntersectionFinderAdder.cpp

   1 /**********************************************************************
   2  *
   3  * GEOS - Geometry Engine Open Source
   4  * http://geos.osgeo.org
   5  *
   6  * Copyright (C) 2006 Refractions Research Inc.
   7  *
   8  * This is free software; you can redistribute and/or modify it under
   9  * the terms of the GNU Lesser General Licence as published
  10  * by the Free Software Foundation.
  11  * See the COPYING file for more information.
  12  *
  13  **********************************************************************
  14  *
  15  * Last port: noding/IntersectionFinderAdder.java rev. 1.5 (JTS-1.9)
  16  *
  17  **********************************************************************/
  18
  19 #include <vector>
  20
  21 #include <geos/noding/IntersectionFinderAdder.h>
  22 #include <geos/noding/SegmentString.h>
  23 #include <geos/noding/NodedSegmentString.h>
  24 #include <geos/algorithm/LineIntersector.h>
  25 #include <geos/geom/Coordinate.h>
  26
  27 using namespace geos::geom;
  28
  29 namespace geos {
  30 namespace noding { // geos.noding
  31
  32 void
  33 IntersectionFinderAdder::processIntersections(
  34                 SegmentString* e0,  int segIndex0,
  35                 SegmentString* e1,  int segIndex1)
  36 {
  37         // don't bother intersecting a segment with itself
  38         if (e0 == e1 && segIndex0 == segIndex1) return;
  39
  40         const Coordinate& p00 = e0->getCoordinate(segIndex0);
  41         const Coordinate& p01 = e0->getCoordinate(segIndex0 + 1);
  42         const Coordinate& p10 = e1->getCoordinate(segIndex1);
  43         const Coordinate& p11 = e1->getCoordinate(segIndex1 + 1);
  44
  45         li.computeIntersection(p00, p01, p10, p11);
  46 //if (li.hasIntersection() && li.isProper()) Debug.println(li);
  47
  48         if (li.hasIntersection())
  49         {
  50                 if (li.isInteriorIntersection())
  51                 {
  52                         for (int intIndex=0, n=li.getIntersectionNum(); intIndex<n; intIndex++)
  53                         {
  54                                 interiorIntersections.push_back(li.getIntersection(intIndex));
  55                         }
  56
  57                         NodedSegmentString* ee0 = dynamic_cast<NodedSegmentString*>(e0);
  58                         NodedSegmentString* ee1 = dynamic_cast<NodedSegmentString*>(e1);
  59                         assert(ee0 && ee1);
  60                         ee0->addIntersections(&li, segIndex0, 0);
  61                         ee1->addIntersections(&li, segIndex1, 1);
  62                 }
  63         }
  64 }
  65
  66 } // namespace geos.noding
  67 } // namespace geos
  68
  69 /**********************************************************************
  70  * $Log$
  71  * Revision 1.3  2006/03/15 09:51:12  strk
  72  * streamlined headers usage
  73  *
  74  * Revision 1.2  2006/02/19 19:46:49  strk
  75  * Packages <-> namespaces mapping for most GEOS internal code (uncomplete, but working). Dir-level libs for index/ subdirs.
  76  *
  77  * Revision 1.1  2006/02/14 13:28:26  strk
  78  * New SnapRounding code ported from JTS-1.7 (not complete yet).
  79  * Buffer op optimized by using new snaprounding code.
  80  * Leaks fixed in XMLTester.
  81  *
  82  **********************************************************************/