Find the intersections of a single line with itself.
This function finds the self-intersections in a line. This is
determined by checking all possible pairs of lines segments.
The iteration starts from the first segment of the line and compares
it with all subsequent segments to find intersections. Then it goes
to the next segment and repeats the process. The intersections are
stored in an array of point
type, which contains the coordinates
of the intersection points.
Type | Intent | Optional | Attributes | Name | ||
---|---|---|---|---|---|---|
real(kind=pr), | intent(in) | :: | lx(:) | |||
real(kind=pr), | intent(in) | :: | ly(:) |
Type | Visibility | Attributes | Name | Initial | |||
---|---|---|---|---|---|---|---|
integer, | public | :: | i | ||||
integer, | public | :: | j | ||||
real(kind=pr), | public | :: | s | ||||
real(kind=pr), | public | :: | t | ||||
real(kind=pr), | public | :: | x | ||||
real(kind=pr), | public | :: | xold | ||||
real(kind=pr), | public | :: | y | ||||
real(kind=pr), | public | :: | yold |