DTGrid3D.hpp File Reference

Main DT-Grid class to create a complete 3D grid structure with a user-defined data type. More...

#include <stdlib.h>
#include <string.h>
#include <cstring>
#include <iostream>
#include <fstream>
#include <sstream>
#include <typeinfo>
#include "ArrayReg.hpp"
#include "ArrayPtr.hpp"
#include "ArrayPrs.hpp"
#include "DTGrid2D.hpp"

Include dependency graph for DTGrid3D.hpp:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Classes
class	DTGrid3D< T, K >

Detailed Description

Main DT-Grid class to create a complete 3D grid structure with a user-defined data type.

Author

Musa Ozboyaci

Copyright

Heidelberg Institute for Theoretical Studies (HITS) 2016

DTGRID ORIGINAL PAPER: M. B. Nielsen and K. Museth. Dynamic Tubular Grid: An efficient data structure and algorithms for high resolution level sets. Accepted for publication in Journal of Scientific Computing, January 26, 2005.

DTGRID data structure is created based on three layers:

DTGrid3D, DTGrid2D and DTGrid1D.

DTGrid1D stores the structure for mapping onto DTGrid2D.

DTGrid2D stores the structure for mapping onto DTGrid3D.

DTGrid3D stores the required structure to the numerical values

To be able to make it more structured and more readable the code is divided into separate files inside separate folders, eventhough many of them keep very simple structures (classes). Files that start with "Array" keep header files for basic array types DTGrid1D, DTGrid2D and DTGrid3D / DTGrid3Dex classes keep the three layered dtgrid structure

Note that this dtgrid implementation is aimed to use as a replacement of UHBD type grids UHBD parameters (dimensions, origin, etc.) can be associated to objects

Warning

Check if all UHBD parameters are included!

The current format of the dtgrid cannot be used effectively for "skins" this is because of the vagueness of that the insideconstant (gamma_i) and outsideconstant (gamma_o) variables are returned depending on the sign of the values nearby! This idea could be used for lennard-jones grids since the skin on the surface will most definitely have large positive values due to strong repulsion. However not suitable for electrostatic grid! This has to be considered!!! Another idea to solve the problem would be to define "shaped skin" rather than using the row one! The shape could be an ellipsoid or a sphere. But then the grid cannot be used for exclusion grid!

Iterators and the neighbourfind methods have yet to be implemented in the present version!