RingSelfIntersection
Table of Contents
-
EPS
= 1.0E-12
-
find()
: array<string|int, array<string|int, Segment>>
-
compareEvent()
: int
-
findIndexForInserting()
: int
-
isLower()
: bool
-
isNotSubsequence()
: bool
EPS
private
mixed
EPS
= 1.0E-12
find()
public
static find(array<string|int, Segment> $segments) : array<string|int, array<string|int, Segment>>
Parameters
-
$segments
: array<string|int, Segment>
-
-
link
-
http://e-maxx.ru/algo/intersecting_segments
Return values
array<string|int, array<string|int, Segment>>
—
compareEvent()
private
static compareEvent(IntersectingEvent $e1, IntersectingEvent $e2) : int
Parameters
-
$e1
: IntersectingEvent
-
-
$e2
: IntersectingEvent
-
Return values
int
—
findIndexForInserting()
private
static findIndexForInserting(Segment $segment, array<string|int, Segment> $segments) : int
Parameters
-
$segment
: Segment
-
-
$segments
: array<string|int, Segment>
-
Return values
int
—
isLower()
private
static isLower(Segment $a, Segment $b) : bool
Parameters
-
$a
: Segment
-
-
$b
: Segment
-
Return values
bool
—
isNotSubsequence()
private
static isNotSubsequence(Segment $a, Segment $b) : bool
Parameters
-
$a
: Segment
-
-
$b
: Segment
-
Return values
bool
—