fossil_cdt_implicit
Source: src/lib/fossil_cdt_implicit.f90
Dependencies
Contents
- mesh_t
- cdt_facet
- locate
- split3
- split_edge
- repoint
- split_constraints
- recover
- find_edge
- mark
- flip
- lawson
- o2
- projected
- opposite
- convex
Variables
| Name | Type | Attributes | Description |
|---|---|---|---|
CDTI_OK | integer(kind=I4P) | parameter | |
CDTI_DEGENERATE | integer(kind=I4P) | parameter | |
CDTI_OUTSIDE | integer(kind=I4P) | parameter | |
CDTI_DUPLICATE | integer(kind=I4P) | parameter | |
CDTI_CROSSING | integer(kind=I4P) | parameter | |
CDTI_RECOVERY | integer(kind=I4P) | parameter | |
MAX_SWEEPS | integer(kind=I4P) | parameter |
Derived Types
mesh_t
Components
| Name | Type | Attributes | Description |
|---|---|---|---|
n | integer(kind=I4P) | ||
v | integer(kind=I4P) | allocatable | |
nb | integer(kind=I4P) | allocatable | |
c | logical | allocatable | |
last | integer(kind=I4P) |
Subroutines
cdt_facet
fortran
subroutine cdt_facet(pts, drop, segs, tris, ntri, status, tcon)Arguments
| Name | Type | Intent | Attributes | Description |
|---|---|---|---|---|
pts | type(implicit_point_t) | in | ||
drop | integer(kind=I4P) | in | ||
segs | integer(kind=I4P) | in | ||
tris | integer(kind=I4P) | out | allocatable | |
ntri | integer(kind=I4P) | out | ||
status | integer(kind=I4P) | out | ||
tcon | logical | out | allocatable, optional |
Call graph
locate
fortran
subroutine locate(m, pts, drop, s0, ip, t, kind, e)Arguments
| Name | Type | Intent | Attributes | Description |
|---|---|---|---|---|
m | type(mesh_t) | inout | ||
pts | type(implicit_point_t) | in | ||
drop | integer(kind=I4P) | in | ||
s0 | integer(kind=I4P) | in | ||
ip | integer(kind=I4P) | in | ||
t | integer(kind=I4P) | out | ||
kind | integer(kind=I4P) | out | ||
e | integer(kind=I4P) | out |
Call graph
split3
fortran
subroutine split3(m, t, p)Arguments
| Name | Type | Intent | Attributes | Description |
|---|---|---|---|---|
m | type(mesh_t) | inout | ||
t | integer(kind=I4P) | in | ||
p | integer(kind=I4P) | in |
Call graph
split_edge
fortran
subroutine split_edge(m, t, e, p)Arguments
| Name | Type | Intent | Attributes | Description |
|---|---|---|---|---|
m | type(mesh_t) | inout | ||
t | integer(kind=I4P) | in | ||
e | integer(kind=I4P) | in | ||
p | integer(kind=I4P) | in |
Call graph
repoint
Attributes: pure
fortran
subroutine repoint(m, side, old, new)Arguments
| Name | Type | Intent | Attributes | Description |
|---|---|---|---|---|
m | type(mesh_t) | inout | ||
side | integer(kind=I4P) | in | ||
old | integer(kind=I4P) | in | ||
new | integer(kind=I4P) | in |
Call graph
split_constraints
fortran
subroutine split_constraints(pts, drop, s0, xy, segs, sub, nsub)Arguments
| Name | Type | Intent | Attributes | Description |
|---|---|---|---|---|
pts | type(implicit_point_t) | in | ||
drop | integer(kind=I4P) | in | ||
s0 | integer(kind=I4P) | in | ||
xy | real(kind=R8P) | in | ||
segs | integer(kind=I4P) | in | ||
sub | integer(kind=I4P) | out | allocatable | |
nsub | integer(kind=I4P) | out |
Call graph
recover
fortran
subroutine recover(m, pts, drop, s0, a, b, status)Arguments
| Name | Type | Intent | Attributes | Description |
|---|---|---|---|---|
m | type(mesh_t) | inout | ||
pts | type(implicit_point_t) | in | ||
drop | integer(kind=I4P) | in | ||
s0 | integer(kind=I4P) | in | ||
a | integer(kind=I4P) | in | ||
b | integer(kind=I4P) | in | ||
status | integer(kind=I4P) | out |
Call graph
find_edge
Attributes: pure
fortran
subroutine find_edge(m, a, b, t, e)Arguments
| Name | Type | Intent | Attributes | Description |
|---|---|---|---|---|
m | type(mesh_t) | in | ||
a | integer(kind=I4P) | in | ||
b | integer(kind=I4P) | in | ||
t | integer(kind=I4P) | out | ||
e | integer(kind=I4P) | out |
Call graph
mark
Attributes: pure
fortran
subroutine mark(m, t, e)Arguments
| Name | Type | Intent | Attributes | Description |
|---|---|---|---|---|
m | type(mesh_t) | inout | ||
t | integer(kind=I4P) | in | ||
e | integer(kind=I4P) | in |
Call graph
flip
fortran
subroutine flip(m, t, e)Arguments
| Name | Type | Intent | Attributes | Description |
|---|---|---|---|---|
m | type(mesh_t) | inout | ||
t | integer(kind=I4P) | in | ||
e | integer(kind=I4P) | in |
Call graph
lawson
fortran
subroutine lawson(m, pts, drop, s0, xy)Arguments
| Name | Type | Intent | Attributes | Description |
|---|---|---|---|---|
m | type(mesh_t) | inout | ||
pts | type(implicit_point_t) | in | ||
drop | integer(kind=I4P) | in | ||
s0 | integer(kind=I4P) | in | ||
xy | real(kind=R8P) | in |
Call graph
Functions
o2
Returns: integer(kind=I4P)
fortran
function o2(pts, drop, s0, i, j, k) result(s)Arguments
| Name | Type | Intent | Attributes | Description |
|---|---|---|---|---|
pts | type(implicit_point_t) | in | ||
drop | integer(kind=I4P) | in | ||
s0 | integer(kind=I4P) | in | ||
i | integer(kind=I4P) | in | ||
j | integer(kind=I4P) | in | ||
k | integer(kind=I4P) | in |
Call graph
projected
Attributes: pure
Returns: real(kind=R8P)
fortran
function projected(x, drop) result(r)Arguments
| Name | Type | Intent | Attributes | Description |
|---|---|---|---|---|
x | real(kind=R8P) | in | ||
drop | integer(kind=I4P) | in |
Call graph
opposite
Attributes: pure
Returns: integer(kind=I4P)
fortran
function opposite(m, t, b, c) result(f)Arguments
| Name | Type | Intent | Attributes | Description |
|---|---|---|---|---|
m | type(mesh_t) | in | ||
t | integer(kind=I4P) | in | ||
b | integer(kind=I4P) | in | ||
c | integer(kind=I4P) | in |
Call graph
convex
Returns: logical
fortran
function convex(m, pts, drop, s0, t, e) result(yes)Arguments
| Name | Type | Intent | Attributes | Description |
|---|---|---|---|---|
m | type(mesh_t) | in | ||
pts | type(implicit_point_t) | in | ||
drop | integer(kind=I4P) | in | ||
s0 | integer(kind=I4P) | in | ||
t | integer(kind=I4P) | in | ||
e | integer(kind=I4P) | in |
Call graph