Class S2Loop.IntersectsRelation

java.lang.Object
com.google.common.geometry.S2Loop.IntersectsRelation
All Implemented Interfaces:
S2Loop.LoopRelation
Enclosing class:
S2Loop

private static final class S2Loop.IntersectsRelation extends Object implements S2Loop.LoopRelation
Loop relation for intersects().
  • Field Details

    • foundSharedVertex

      private boolean foundSharedVertex
  • Constructor Details

    • IntersectsRelation

      private IntersectsRelation()
  • Method Details

    • foundSharedVertex

      public boolean foundSharedVertex()
    • aCrossingTarget

      public int aCrossingTarget()
      If A.contains(P) == false invalid input: '&'invalid input: '&' B.contains(P) == true, it is equivalent to having an edge crossing (i.e., intersects() returns true).
      Specified by:
      aCrossingTarget in interface S2Loop.LoopRelation
    • bCrossingTarget

      public int bCrossingTarget()
      Specified by:
      bCrossingTarget in interface S2Loop.LoopRelation
    • wedgesCross

      public boolean wedgesCross(S2Point a0, S2Point ab1, S2Point a2, S2Point b0, S2Point b2)
      Description copied from interface: S2Loop.LoopRelation
      Given a vertex ab1 that is shared between the two loops, returns true if the two associated wedges (a0, ab1, b2) and (b0, ab1, b2) are equivalent to an edge crossing. The loop relation is also allowed to maintain its own internal state, and can return true if it observes any sequence of wedges that are equivalent to an edge crossing.
      Specified by:
      wedgesCross in interface S2Loop.LoopRelation