Uses of Class
com.vividsolutions.jts.geomgraph.index.SegmentIntersector

Packages that use SegmentIntersector
com.vividsolutions.jts.geomgraph Contains classes that implement topology graphs. 
com.vividsolutions.jts.geomgraph.index Contains classes that implement indexes for performing noding on geometry graph edges. 
 

Uses of SegmentIntersector in com.vividsolutions.jts.geomgraph
 

Methods in com.vividsolutions.jts.geomgraph that return SegmentIntersector
 SegmentIntersector GeometryGraph.computeEdgeIntersections(GeometryGraph g, LineIntersector li, boolean includeProper)
           
 SegmentIntersector GeometryGraph.computeSelfNodes(LineIntersector li, boolean computeRingSelfNodes)
          Compute self-nodes, taking advantage of the Geometry type to minimize the number of intersection tests.
 

Uses of SegmentIntersector in com.vividsolutions.jts.geomgraph.index
 

Methods in com.vividsolutions.jts.geomgraph.index with parameters of type SegmentIntersector
 void SimpleSweepLineIntersector.computeIntersections(List edges0, List edges1, SegmentIntersector si)
           
 void SimpleMCSweepLineIntersector.computeIntersections(List edges0, List edges1, SegmentIntersector si)
           
 void SimpleEdgeSetIntersector.computeIntersections(List edges0, List edges1, SegmentIntersector si)
           
abstract  void EdgeSetIntersector.computeIntersections(List edges0, List edges1, SegmentIntersector si)
          Computes all mutual intersections between two sets of edges.
 void SimpleSweepLineIntersector.computeIntersections(List edges, SegmentIntersector si, boolean testAllSegments)
           
 void SimpleMCSweepLineIntersector.computeIntersections(List edges, SegmentIntersector si, boolean testAllSegments)
           
 void SimpleEdgeSetIntersector.computeIntersections(List edges, SegmentIntersector si, boolean testAllSegments)
           
abstract  void EdgeSetIntersector.computeIntersections(List edges, SegmentIntersector si, boolean testAllSegments)
          Computes all self-intersections between edges in a set of edges, allowing client to choose whether self-intersections are computed.
 void MonotoneChain.computeIntersections(MonotoneChain mc, SegmentIntersector si)
           
 void SweepLineSegment.computeIntersections(SweepLineSegment ss, SegmentIntersector si)
           
 void MonotoneChainEdge.computeIntersects(MonotoneChainEdge mce, SegmentIntersector si)
           
 void MonotoneChainEdge.computeIntersectsForChain(int chainIndex0, MonotoneChainEdge mce, int chainIndex1, SegmentIntersector si)
           
 



Copyright © 2012. All Rights Reserved.