************80
POINTS_DELAUNAY_NAIVE_2D is a naive Delaunay triangulation scheme.
| Type | Intent | Optional | Attributes | Name | ||
|---|---|---|---|---|---|---|
| integer(kind=4) | :: | node_num | ||||
| real(kind=8) | :: | node_xy(dim_num,node_num) | ||||
| integer(kind=4) | :: | maxtri | ||||
| integer(kind=4) | :: | triangle_num | ||||
| integer(kind=4) | :: | triangle_node(3,maxtri) |
| Type | Visibility | Attributes | Name | Initial | |||
|---|---|---|---|---|---|---|---|
| integer(kind=4), | public, | parameter | :: | dim_num | = | 2 | |
| logical, | public | :: | flag | ||||
| integer(kind=4), | public | :: | i | ||||
| integer(kind=4), | public | :: | j | ||||
| integer(kind=4), | public | :: | k | ||||
| integer(kind=4), | public | :: | m | ||||
| real(kind=8), | public | :: | xn | ||||
| real(kind=8), | public | :: | yn | ||||
| real(kind=8), | public | :: | z(node_num) | ||||
| real(kind=8), | public | :: | zn |