My Project
|
Result structure representing minimal derived topology and geometry of a geological model in corner-point format. More...
#include <preprocess.h>
Public Attributes | |
int | m |
Upper bound on "number_of_faces". | |
int | n |
Upper bound on "number_of_nodes". | |
int | dimensions [3] |
Cartesian box dimensions. | |
int | number_of_faces |
Total number of unique grid faces (i.e., connections). | |
int * | face_nodes |
Node (vertex) numbers of each face, stored sequentially. | |
int * | face_ptr |
Start position for each face's ‘face_nodes’. | |
int * | face_neighbors |
Global cell numbers. | |
enum face_tag * | face_tag |
Classification of grid's individual connections (faces). | |
int | number_of_nodes |
Number of unique grid vertices. | |
int | number_of_nodes_on_pillars |
Total number of unique cell vertices that lie on pillars. | |
double * | node_coordinates |
Vertex coordinates. | |
int | number_of_cells |
Number of active grid cells. | |
int * | local_cell_index |
Deceptively named local-to-global cell index mapping. | |
Result structure representing minimal derived topology and geometry of a geological model in corner-point format.
int* processed_grid::face_neighbors |
Global cell numbers.
Two elements per face, stored sequentially.
int processed_grid::m |
Upper bound on "number_of_faces".
For internal use in function process_grid()'s memory management.
int processed_grid::n |
Upper bound on "number_of_nodes".
For internal use in function process_grid()'s memory management.
double* processed_grid::node_coordinates |
Vertex coordinates.
Three doubles (