Examples of org.geotools.geometry.iso.util.algorithm2D.LineIntersector

Package org.geotools.geometry.iso.util.algorithm2D

Examples of org.geotools.geometry.iso.util.algorithm2D.LineIntersector

org.geotools.geometry.iso.util.algorithm2D.LineIntersector
A LineIntersector is an algorithm that can both test whether two line segments intersect and compute the intersection point if they do. The intersection point may be computed in a precise or non-precise manner. Computing it precisely involves rounding it to an integer. (This assumes that the input coordinates have been made precise by scaling them to an integer grid.) @source $URL$

    // TODO auskommentiert; checken!
    // if (geom.isEmpty())
    // return true;


    GeometryGraph graph = new GeometryGraph(0, geom);
    LineIntersector li = new RobustLineIntersector();
    SegmentIntersector si = graph.computeSelfNodes(li, true);
    // if no self-intersection, must be simple
    
    // Primitives can be simple even if their boundary intersect
    // Complexes are not simple if their boundary intersect

View Full Code Here

TOP

Related Classes of org.geotools.geometry.iso.util.algorithm2D.LineIntersector

org.geotools.geometry.iso.operation.IsSimpleOp

org.geotools.geometry.iso.topograph2D.Coordinate

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.