Hi Wolfgang
Now, if this were a 2d data set, you'd just have to go through every > possible > voxel, see if the data indeed indicates that this is a cell; if so, you'll > need to ad an entry to the list of the cells (in the array that you will > give > to Triangulation::create_triangulation) with the adjacent vertices in it. > As > I said, take a look at step-14 on how to build these records. > > Could you possibly clarify some issues for me: For the example I gave above, which is 3x2x2, the example points are: .... ... 2 0 0 3 0 0 0 1 0 ... ... Each coordinate above represents a voxel. So, essentially, each voxel is a cell !?! So, I know the cells to give to create:::triangulation, but what would the list of vertices be? Also, because there are so many voxels, and consequently vertices, how can I automatically generate the correct ordering of the vertices like you did in step-14 ? This questions are probably trivial but the answers would help clarify matters in my mind and give me a clearer understanding of how to use deal.II to solve this problem. Many thanks Ted
_______________________________________________ dealii mailing list http://poisson.dealii.org/mailman/listinfo/dealii
