|
Basilisk CFD
Adaptive Cartesian mesh PDE framework
|
To compute the minimal distance and its sign, we need to store information on the closest (2 in 2D, 12 in 3D) elements. More...
#include <distance.h>
Data Fields | |
| double | d2 |
| coord * | v |
| int | type |
To compute the minimal distance and its sign, we need to store information on the closest (2 in 2D, 12 in 3D) elements.
Definition at line 191 of file distance.h.
| double closest_t::d2 |
Definition at line 192 of file distance.h.
| int closest_t::type |
Definition at line 194 of file distance.h.
| coord* closest_t::v |
Definition at line 193 of file distance.h.