/// <summary> /// /// </summary> /// <returns></returns> public bool IsNodeConsistentArea() { SegmentIntersector intersector = _geomGraph.ComputeSelfNodes(_li); if (intersector.HasProperIntersection) { _invalidPoint = intersector.ProperIntersectionPoint; return(false); } _nodeGraph.Build(_geomGraph); return(IsNodeEdgeAreaLabelsConsistent()); }
/// <summary> /// Check all nodes to see if their labels are consistent with /// area topology. /// </summary> /// <returns> /// <c>true</c> if this area has a consistent node labelling /// </returns> public bool IsNodeConsistentArea() { // To fully check validity, it is necessary to // compute ALL intersections, including self-intersections // Within a single edge. SegmentIntersector intersector = geomGraph.ComputeSelfNodes(li, true); if (intersector.HasProperIntersection()) { invalidPoint = intersector.ProperIntersectionPoint; return(false); } nodeGraph.Build(geomGraph); return(IsNodeEdgeAreaLabelsConsistent()); }