Commit Graph
12 Commits
Author SHA1 Message Date
Jostein R. Natvig 37296545a4 1) Move extra fields found in struct CornerpointGrid into struct UnstructuredGrid.
2) Remove typedef grid_t
3) Remove struct CornerpointGrid.
4) handle fallout.
2012-02-01 14:56:38 +01:00
Jostein R. Natvig 04f88cee52 Add new version of well datastructure. 2012-02-01 12:16:05 +01:00
Jostein R. Natvig f56c67081d Copy modifications to reorder-related codes from MRST repository
branches/mrst-reorg/mex/reorder-C, revision 8955.

The changes are: (1) addition of documentation of input arguments in
tarjan.c and (2) an MIT licence header (codes originated in a PhD
project).
2012-01-25 10:49:49 +01:00
Jostein R. Natvig 3d40b45cd7 Add bare-bones implementation of reordering algorithm.
Lightly tested.
2012-01-17 14:39:09 +01:00
Jostein R. Natvig 6ae51908fa Remove Matlab binding. 2010-11-19 10:20:48 +01:00
Jostein R. Natvig ee6fe14e48 Remove unnecessary argument in mim_ip_simple_all; fix affected code;
as suggested by bska.
2010-11-05 22:05:55 +01:00
Jostein R. Natvig 7459c5988e Add bare-bones explicit mobility-weighted upwind solver for two-phase
incompressible flow.
2010-11-02 09:10:36 +01:00
Jostein R. Natvig d31614d608 Fix embarrasing error. 2010-08-20 14:18:22 +00:00
Jostein R. Natvig a9034efbe7 Four-space indentation. 2010-08-19 11:02:50 +00:00
Jostein R. Natvig ceb2e48422 Add comment. 2010-08-19 10:52:10 +00:00
Jostein R. Natvig 2648e559d3 A depth-first graph traversal to find connected components of graph. 2010-08-19 10:46:58 +00:00
Jostein R. Natvig a3c93003ee Initial checkin of cornerpoint processing code.
Current status
--------------
Given vectors ZCORN, COORD and ACTNUM as well as the Cartesian
dimensions these vectors implicitly refer to, the code is
currently capable of

 * Identify unique points along each pillar
 * Assign point numbers for each point specified in ZCORN
 * Compute face topology, i.e., the corners that define the geometry
   of the faces as well as the cells that are connected through the face.
 * Identify and compute intesections that occur in the processing of
   face topology.

What remains is

 * Handle the face geometry of boundary faces. (simple)
 * Compute point coordinates of the final point list.
 * Put all pieces together in a tidy manner.
2009-06-11 07:33:50 +00:00