CompareBoundaryRelation

Loop relation for CompareBoundary().

Constructors

this
this(bool reverse_b)
Undocumented in source.

Members

Functions

aCrossingTarget
int aCrossingTarget()
Undocumented in source. Be warned that the author may not have intended to support it.
bCrossingTarget
int bCrossingTarget()
Undocumented in source. Be warned that the author may not have intended to support it.
containsEdge
bool containsEdge()
Undocumented in source. Be warned that the author may not have intended to support it.
foundSharedVertex
bool foundSharedVertex()
Undocumented in source. Be warned that the author may not have intended to support it.
wedgesCross
bool wedgesCross(S2Point a0, S2Point ab1, S2Point a2, S2Point b0, S2Point b2)
Undocumented in source. Be warned that the author may not have intended to support it.

Variables

_containsEdge
bool _containsEdge;
Undocumented in source.
_excludesEdge
bool _excludesEdge;
Undocumented in source.
_foundSharedVertex
bool _foundSharedVertex;
Undocumented in source.
_reverseB
bool _reverseB;
Undocumented in source.

Inherited Members

From LoopRelation

aCrossingTarget
int aCrossingTarget()

Optionally, a_target() and b_target() can specify an early-exit condition for the loop relation. If any point P is found such that

bCrossingTarget
int bCrossingTarget()
Undocumented in source.
wedgesCross
bool wedgesCross(S2Point a0, S2Point ab1, S2Point a2, S2Point b0, S2Point b2)

Given a vertex "ab1" that is shared between the two loops, return 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.

Meta