# geos::noding::IntersectionAdder Class Reference

`#include <IntersectionAdder.h>`

Inheritance diagram for geos::noding::IntersectionAdder:

List of all members.

## Public Member Functions

| IntersectionAdder (algorithm::LineIntersector &newLi)
algorithm::LineIntersector & | getLineIntersector ()
const geom::Coordinate * | getProperIntersectionPoint ()
bool | hasIntersection ()
bool | hasProperIntersection ()
bool | hasProperInteriorIntersection ()
bool | hasInteriorIntersection ()
void | processIntersections (SegmentString *e0, int segIndex0, SegmentString *e1, int segIndex1)
virtual bool | isDone () const

## Static Public Member Functions

static bool | isAdjacentSegments (int i1, int i2)

## Public Attributes

int | numIntersections
int | numInteriorIntersections
int | numProperIntersections
int | numTests

## Detailed Description

Computes the intersections between two line segments in SegmentString and adds them to each string. The SegmentIntersector is passed to a Noder. The addIntersections method is called whenever the Noder detects that two SegmentStrings might intersect. This class is an example of the Strategy pattern.

## Member Function Documentation

const geom::Coordinate* geos::noding::IntersectionAdder::getProperIntersectionPoint | ( | ) | `[inline]`

Returns:
  the proper intersection point, or `NULL` if none was found

bool geos::noding::IntersectionAdder::hasInteriorIntersection | ( | ) | `[inline]`

An interior intersection is an intersection which is in the interior of some segment.

bool geos::noding::IntersectionAdder::hasProperInteriorIntersection | ( | ) | `[inline]`

A proper interior intersection is a proper intersection which is not contained in the set of boundary nodes set for this SegmentIntersector.

bool geos::noding::IntersectionAdder::hasProperIntersection | ( | ) | `[inline]`

A proper intersection is an intersection which is interior to at least two line segments. Note that a proper intersection is not necessarily in the interior of the entire Geometry, since another edge may have an endpoint equal to the intersection, which according to SFS semantics can result in the point being on the Boundary of the Geometry.

virtual bool geos::noding::IntersectionAdder::isDone | ( | ) | const`[inline, virtual]`

Always process all intersections

Returns:
  false always

Reimplemented from geos::noding::SegmentIntersector.

void geos::noding::IntersectionAdder::processIntersections | ( | SegmentString * | e0,
|  | int | segIndex0,
|  | SegmentString * | e1,
|  | int | segIndex1
| ) |  | `[virtual]`

This method is called by clients of the SegmentIntersector class to process intersections for two segments of the SegmentStrings being intersected. Note that some clients (such as MonotoneChains) may optimize away this call for segment pairs which they have determined do not intersect (e.g. by an disjoint envelope test).

Implements geos::noding::SegmentIntersector.

The documentation for this class was generated from the following file:

- IntersectionAdder.h