Class S2EdgeUtil.WedgeContainsOrCrosses

java.lang.Object
com.google.common.geometry.S2EdgeUtil.WedgeContainsOrCrosses
All Implemented Interfaces:
S2EdgeUtil.WedgeProcessor
Enclosing class:
S2EdgeUtil

public static class S2EdgeUtil.WedgeContainsOrCrosses extends Object implements S2EdgeUtil.WedgeProcessor
  • Constructor Details

    • WedgeContainsOrCrosses

      public WedgeContainsOrCrosses()
  • Method Details

    • test

      public int test(S2Point a0, S2Point ab1, S2Point a2, S2Point b0, S2Point b2)
      Given two edge chains (see WedgeRelation above), this function returns +1 if A contains B, 0 if B contains A or the two wedges do not intersect, and -1 if the edge chains A and B cross each other (i.e. if A intersects both the interior and exterior of the region to the left of B). In degenerate cases where more than one of these conditions is satisfied, the maximum possible result is returned. For example, if A == B then the result is +1.
      Specified by:
      test in interface S2EdgeUtil.WedgeProcessor