amesh.cpp 42.7 KB
Newer Older
1
#include "amesh.h"
SilverLife's avatar
SilverLife committed
2
#include <iomanip>
3
#include <set>
SilverLife's avatar
SilverLife committed
4

Kirill Terekhov's avatar
Kirill Terekhov committed
5
//using namespace std;
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37

/// todo:
/// 1. coarsment
/// 2. strategy for faces/edges with faults
/// 3. geom model support
/// 4. make class abstract virtual for user implementation of refinement and coarsment indicators
/// see in code todo:
namespace INMOST
{
	void CleanupSets(ElementSet set)
	{
		ElementSet::iterator it = set.Begin();
		while(it != set.End())
		{
			if( it->isValid() ) ++it;
			else it = set.Erase(it);
		}
		for(ElementSet child = set.GetChild(); child.isValid(); child = child.GetSibling())
			CleanupSets(child);
	}
	
	void ReduceMax(const Tag & tag, const Element & element, const INMOST_DATA_BULK_TYPE * data, INMOST_DATA_ENUM_TYPE size)
	{
		(void) size;
		element->Integer(tag) = std::max(element->Integer(tag),*((const INMOST_DATA_INTEGER_TYPE *)data));
	}
	
	void ReduceMin(const Tag & tag, const Element & element, const INMOST_DATA_BULK_TYPE * data, INMOST_DATA_ENUM_TYPE size)
	{
		(void) size;
		element->Integer(tag) = std::min(element->Integer(tag),*((const INMOST_DATA_INTEGER_TYPE *)data));
	}
SilverLife's avatar
SilverLife committed
38
39


Kirill Terekhov's avatar
Kirill Terekhov committed
40
    void AdaptiveMesh::PrintSetLocal(std::string offset, ElementSet it, std::stringstream& ss)
SilverLife's avatar
SilverLife committed
41
    {
Kirill Terekhov's avatar
Kirill Terekhov committed
42
43
        std::stringstream ss1;
        ss1 << offset << rank << ": Set : " << std::setw(5) << it.GetName() << " ";
SilverLife's avatar
SilverLife committed
44
45
        for (int i = ss1.str().length(); i < 23; i++) ss1 << " ";
        ss << ss1.str();
Kirill Terekhov's avatar
Kirill Terekhov committed
46
        ss << std::setw(6);
SilverLife's avatar
SilverLife committed
47
48
49
50
51
        if (it.GetStatus() == Element::Shared) ss << "shared";
        else if (it.GetStatus() == Element::Ghost) ss << "ghost";
        else if (it.GetStatus() == Element::Owned) ss << "owned";
        else ss << "none";

52
        ss << " tag_owner (" << it.IntegerDF(m->OwnerTag()) << ")";
SilverLife's avatar
SilverLife committed
53
54
55

        //ss << "   level (" << level[it.self()] << ")  ";
        ss << " tag_processors (";
Kirill Terekhov's avatar
Kirill Terekhov committed
56
        std::stringstream ss2;
57
        Storage::integer_array arr = it.IntegerArrayDV(m->ProcessorsTag());
SilverLife's avatar
SilverLife committed
58
59
        for (int i = 0; i < arr.size(); i++)
            ss2 << arr[i] << " ";
Kirill Terekhov's avatar
Kirill Terekhov committed
60
        ss << std::setw(5) << ss2.str() <<")";
SilverLife's avatar
SilverLife committed
61
62
63
64
65
66
67
68
        

        ElementSet::iterator p = it.Begin();
        ss << "     | Refs: ";
        int first = 0;
        while(p != it.End())
        {
        //    if (first++ == 0) ss << endl << offset << "   ";
Kirill Terekhov's avatar
Kirill Terekhov committed
69
            std::string type = "unknw";
SilverLife's avatar
SilverLife committed
70
71
72
73
            if (p->GetElementType() == CELL) type = "cell";
            if (p->GetElementType() == FACE) type = "face";
            if (p->GetElementType() == EDGE) type = "edge";
            if (p->GetElementType() == NODE) type = "node";
Kirill Terekhov's avatar
Kirill Terekhov committed
74
            ss << type << "-" << std::setw(2) << p->GlobalID() << " ";
SilverLife's avatar
SilverLife committed
75
76
            p++;
        }
Kirill Terekhov's avatar
Kirill Terekhov committed
77
        ss << std::endl;
SilverLife's avatar
SilverLife committed
78
79
80
81
82
83
84
85
86
87

        for(ElementSet child = it.GetChild(); child.isValid(); child = child.GetSibling())
        {
            PrintSetLocal(offset + "   ",child,ss);
        }
    }


    void AdaptiveMesh::PrintSet()
    {
Kirill Terekhov's avatar
Kirill Terekhov committed
88
        std::stringstream ss;
89
        for(Mesh::iteratorSet it = m->BeginSet(); it != m->EndSet(); ++it) 
SilverLife's avatar
SilverLife committed
90
        {
Kirill Terekhov's avatar
Kirill Terekhov committed
91
            //if (it->HaveParent()) continue;
92
            PrintSetLocal("",ElementSet(m,*it),ss);
SilverLife's avatar
SilverLife committed
93
        }
Kirill Terekhov's avatar
Kirill Terekhov committed
94
        std::cout << ss.str() << std::endl;
SilverLife's avatar
SilverLife committed
95
96
    }

Kirill Terekhov's avatar
Kirill Terekhov committed
97
    void PrintRefs(std::ostream& os, Storage::reference_array refs)
98
99
100
    {
        for(Storage::reference_array::size_type i = 0; i < refs.size(); ++i)
        {
Kirill Terekhov's avatar
Kirill Terekhov committed
101
            std::string type = "unknw";
102
103
104
105
106
107
108
            if (refs[i].GetElementType() == CELL) type = "cell";
            if (refs[i].GetElementType() == FACE) type = "face";
            if (refs[i].GetElementType() == EDGE) type = "edge";
            if (refs[i].GetElementType() == NODE) type = "node";
            os << "(" << type << "," << refs[i]->GlobalID() << ") ";
			Storage::real xyz[3] = {0,0,0};
            refs[i]->Centroid(xyz);
Kirill Terekhov's avatar
Kirill Terekhov committed
109
            os << "(" << xyz[0] << "," << xyz[1] << "," << xyz[2] <<")" <<  std::endl;
110
111
112
113
114
        }


    }

Kirill Terekhov's avatar
Kirill Terekhov committed
115
    void AdaptiveMesh::PrintMesh(std::ostream& os, int cell, int face, int edge, int node)
SilverLife's avatar
SilverLife committed
116
117
    {
        if (cell + face + edge + node == 0) return;
Kirill Terekhov's avatar
Kirill Terekhov committed
118
119
        std::stringstream ss;
        ss << "================= " << rank << " =====================" << std::endl;
SilverLife's avatar
SilverLife committed
120
121
        if (cell)
        {
Kirill Terekhov's avatar
Kirill Terekhov committed
122
            ss << "Cells: " << m->NumberOfCells() <<  std::endl;
123
            for(Mesh::iteratorCell it = m->BeginCell(); it != m->EndCell(); ++it) 
SilverLife's avatar
SilverLife committed
124
            {
125
                ss << rank << ": " << it->GlobalID() << " - " << it->LocalID() << " - ";            
SilverLife's avatar
SilverLife committed
126
127
128
                if (it->GetStatus() == Element::Shared) ss << "shared";
                else if (it->GetStatus() == Element::Ghost) ss << "ghost";
                else ss << "none";
129
130
131
132
133
134
135
136
137
138
                
                /*
                ss << " (";
                Storage::integer_array arr = it->IntegerArrayDV(tag_processors);
                for (int i = 0; i < arr.size(); i++) ss << arr[i] << " ";
                ss << ") ";
*/
                /*
                Storage::reference_array refs = hanging_nodes[it->self()];
                if (refs.size() > 0)
SilverLife's avatar
SilverLife committed
139
                {
Kirill Terekhov's avatar
Kirill Terekhov committed
140
                    ss << std::endl << "   Hanging nodes: ";
141
                    PrintRefs(ss,refs);
SilverLife's avatar
SilverLife committed
142
                }
Kirill Terekhov's avatar
Kirill Terekhov committed
143
                ss << std::endl;
144
145
146
147
148
149
                ss << "   ParentSet: " << ElementSet(this,parent_set[*it]).GetName();
                */
/*
                orage::reference_array refs = ref_tag[it->self()];
                PrintRefs(refs);
                */
Kirill Terekhov's avatar
Kirill Terekhov committed
150
                    ss << std::endl;
SilverLife's avatar
SilverLife committed
151
152
153
154
155
            }
        }

        if (face)
        {
Kirill Terekhov's avatar
Kirill Terekhov committed
156
            ss << "Faces: " << m->NumberOfFaces() <<  std::endl;
157
            for(Mesh::iteratorFace it = m->BeginFace(); it != m->EndFace(); ++it) 
SilverLife's avatar
SilverLife committed
158
            {
Kirill Terekhov's avatar
Kirill Terekhov committed
159
160
                ss << rank << ": " << std::setw(2) << it->LocalID() << " " << std::setw(2) << it->GlobalID() << " - " ;            
                ss << std::setw(6);
SilverLife's avatar
SilverLife committed
161
162
163
164
                if (it->GetStatus() == Element::Shared) ss << "shared";
                else if (it->GetStatus() == Element::Ghost) ss << "ghost";
                else ss << "none";

165
166
167

                double xyz[3];
                it->Centroid(xyz);
Kirill Terekhov's avatar
Kirill Terekhov committed
168
                ss << "   (" << std::setw(5) << xyz[0] << " " << std::setw(5) << xyz[1] << " " << std::setw(5) << xyz[2] << ")";
169

170
                ss << "  " << m->GetMarker(*it,m->NewMarker());
171
172
173
174

                ss << " nc(" << it->getNodes().size() << ": "; 
                ElementArray<Node> nodes = it->getNodes();
                for (ElementArray<Node>::iterator node = nodes.begin(); node != nodes.end(); node++)
Kirill Terekhov's avatar
Kirill Terekhov committed
175
                    ss << std::setw(2) << node->GlobalID() << " ";
176
177
178
                ss << ")";

                /*
SilverLife's avatar
SilverLife committed
179
180
181
182
183
184
185
186
187
188
189
190
                Storage::reference_array refs = ref_tag[it->self()];
                if (refs.size() > 0) ss << ". Ref: ";
                for(Storage::reference_array::size_type i = 0; i < refs.size(); ++i)
                {
                    string type = "unknw";
                    if (refs[i].GetElementType() == CELL) type = "cell";
                    if (refs[i].GetElementType() == FACE) type = "face";
                    if (refs[i].GetElementType() == EDGE) type = "edge";
                    if (refs[i].GetElementType() == NODE) type = "node";
                    ss << "(" << type << "," << refs[i]->GlobalID() << ") ";
                }

Kirill Terekhov's avatar
Kirill Terekhov committed
191
                ss << std::endl;
192
193
194
195
196

                {
                    Storage::reference_array refs = hanging_nodes[it->self()];
                    if (refs.size() > 0)
                    {
Kirill Terekhov's avatar
Kirill Terekhov committed
197
                        ss << std::endl << "   Hanging nodes: ";
198
199
                        PrintRefs(ss,refs);
                    }
Kirill Terekhov's avatar
Kirill Terekhov committed
200
                    ss << std::endl;
201
                }
202
                */
Kirill Terekhov's avatar
Kirill Terekhov committed
203
                ss << std::endl;
SilverLife's avatar
SilverLife committed
204
205
206
207
208
            }
        }

        if (edge)
        {
Kirill Terekhov's avatar
Kirill Terekhov committed
209
            ss << "Edges: " << m->NumberOfEdges() <<  std::endl;
210
            for(Mesh::iteratorEdge it = m->BeginEdge(); it != m->EndEdge(); ++it) 
SilverLife's avatar
SilverLife committed
211
212
213
214
215
            {
                ss << rank << ": " << it->GlobalID() << " - " ;            
                if (it->GetStatus() == Element::Shared) ss << "shared";
                else if (it->GetStatus() == Element::Ghost) ss << "ghost";
                else ss << "none";
Kirill Terekhov's avatar
Kirill Terekhov committed
216
				/*
SilverLife's avatar
SilverLife committed
217
218
219
220
                Storage::reference_array refs = ref_tag[it->self()];
                if (refs.size() > 0) ss << ". Ref: ";
                for(Storage::reference_array::size_type i = 0; i < refs.size(); ++i)
                {
Kirill Terekhov's avatar
Kirill Terekhov committed
221
                    std::string type = "unknw";
SilverLife's avatar
SilverLife committed
222
223
224
225
226
227
                    if (refs[i].GetElementType() == CELL) type = "cell";
                    if (refs[i].GetElementType() == FACE) type = "face";
                    if (refs[i].GetElementType() == EDGE) type = "edge";
                    if (refs[i].GetElementType() == NODE) type = "node";
                    ss << "(" << type << "," << refs[i]->GlobalID() << ") ";
                }
Kirill Terekhov's avatar
Kirill Terekhov committed
228
229
                */
                ss << std::endl;
SilverLife's avatar
SilverLife committed
230
231
232
233
234
            }
        }

        if (node)
        {
Kirill Terekhov's avatar
Kirill Terekhov committed
235
            ss << "Nodes:" << std::endl;
236
            for(Mesh::iteratorNode it = m->BeginNode(); it != m->EndNode(); ++it) 
SilverLife's avatar
SilverLife committed
237
            {
Kirill Terekhov's avatar
Kirill Terekhov committed
238
239
                ss << rank << ": " << std::setw(2) << it->GlobalID() << " - " ;            
                ss << std::setw(6);
SilverLife's avatar
SilverLife committed
240
241
242
243
244
                if (it->GetStatus() == Element::Shared) ss << "shared";
                else if (it->GetStatus() == Element::Ghost) ss << "ghost";
                else ss << "none";

                {
Kirill Terekhov's avatar
Kirill Terekhov committed
245
					/*
SilverLife's avatar
SilverLife committed
246
247
248
249
                    Storage::reference_array refs = ref_tag[it->self()];
                    if (refs.size() > 0) ss << ". Ref: ";
                    for(Storage::reference_array::size_type i = 0; i < refs.size(); ++i)
                    {
Kirill Terekhov's avatar
Kirill Terekhov committed
250
                        std::string type = "unknw";
SilverLife's avatar
SilverLife committed
251
                        if (refs[i].GetElementType() == CELL) type = "cell";
252
253
						if (refs[i].GetElementType() == FACE) type = "face";
						if (refs[i].GetElementType() == EDGE) type = "edge";
SilverLife's avatar
SilverLife committed
254
255
256
257
                        if (refs[i].GetElementType() == NODE) type = "node";
                        ss << "(" << type << "," << refs[i]->GlobalID() << ") ";
                        
                    }
Kirill Terekhov's avatar
Kirill Terekhov committed
258
					*/
259
                    ss << "  " << m->GetMarker(*it,m->NewMarker());
260
261

                    ss << "(" << 
Kirill Terekhov's avatar
Kirill Terekhov committed
262
263
264
                        std::setw(3) << it->RealArray(m->CoordsTag())[0] << " " << 
                        std::setw(3) << it->RealArray(m->CoordsTag())[1] << " " << 
                        std::setw(3) << it->RealArray(m->CoordsTag())[2] << ")";
265

SilverLife's avatar
SilverLife committed
266
                }
Kirill Terekhov's avatar
Kirill Terekhov committed
267
                ss << std::endl;
SilverLife's avatar
SilverLife committed
268
269
270
            }
        }

Kirill Terekhov's avatar
Kirill Terekhov committed
271
272
        ss << "=========================================" << std::endl;
        os << ss.str() << std::endl;
SilverLife's avatar
SilverLife committed
273
274
275
276
277
278
279
    }

    void AdaptiveMesh::UpdateStatus()
    {

        for(ElementType mask = CELL; mask >= NODE; mask = PrevElementType(mask))
        {
280
            for(Mesh::iteratorElement it = m->BeginElement(mask); it != m->EndElement(); it++)
SilverLife's avatar
SilverLife committed
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
            {
                int stat = 0;
                if (it->GetStatus() == Element::Shared) stat = 1;
                else if (it->GetStatus() == Element::Ghost)  stat = 2;

                tag_status[it->self()] = stat;
            }
        }
    }
    
    void AdaptiveMesh::PrintSet(ElementSet set, std::string offset)
    {
        std::cout << offset << "Set: " << std::endl;

		ElementSet::iterator it = set.Begin();
		while(it != set.End())
        {
298
		    ElementSet parent(m,parent_set[*it]);
SilverLife's avatar
SilverLife committed
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
            std::cout << offset << it->GlobalID() << " - " << level[*it] << " : ";
		    
            ElementSet::iterator p = parent.Begin();
    		while(p != parent.End())
            {
                std::cout << p->GlobalID() << " ";
                p++;
            }
            std::cout << std::endl;
            it++;
        }

		for(ElementSet child = set.GetChild(); child.isValid(); child = child.GetSibling())
        {
            PrintSet(child,offset + "  ");
        }

    }

318
319
320
    void AdaptiveMesh::SynchronizeSet(ElementSet set)
    {
    #ifdef USE_MPI
321
322
        int size = m->GetProcessorsNumber();
        int rank = m->GetProcessorRank();
323
324
        for (int i = 0; i < size; i++)
        {
325
326
            set.IntegerArray(m->SendtoTag()).push_back(i);
            m->ExchangeMarked();
327
328
329
330
        }
    #endif
    }

SilverLife's avatar
SilverLife committed
331
332
    void AdaptiveMesh::Test()
    {
Kirill Terekhov's avatar
Kirill Terekhov committed
333
        std::cout << rank << ": ================" << std::endl;
SilverLife's avatar
SilverLife committed
334
335
        PrintSet(root,"");
    }
336
337
338
339
	
	
	void AdaptiveMesh::ClearData()
	{
Kirill Terekhov's avatar
Kirill Terekhov committed
340
341
342
		level         = m->DeleteTag(level);
		hanging_nodes = m->DeleteTag(hanging_nodes);
		parent_set    = m->DeleteTag(parent_set);
343
344
345
346
347
348
349
350
		root.DeleteSetTree();
	}
	
	void AdaptiveMesh::PrepareSet()
	{
		//retrive set for coarsening, initialize set if is not present
		if( !root.isValid() )
		{
Kirill Terekhov's avatar
Kirill Terekhov committed
351
			root = m->GetSet("ROOT_SET");
352
353
			if( root == InvalidElement() )
			{
Kirill Terekhov's avatar
Kirill Terekhov committed
354
				root = m->CreateSetUnique("ROOT_SET").first;
355
				level[root] = 0;
Kirill Terekhov's avatar
Kirill Terekhov committed
356
				for(Mesh::iteratorCell it = m->BeginCell(); it != m->EndCell(); ++it)
357
358
359
360
361
				{
					root.PutElement(it->self());
					parent_set[it->self()] = root.GetHandle();
				}
			}
SilverLife's avatar
SilverLife committed
362
        }
Kirill Terekhov's avatar
Kirill Terekhov committed
363
		if( !m->HaveGlobalID(CELL) ) m->AssignGlobalID(CELL); //for unique set names
364
365
	}
	
Kirill Terekhov's avatar
Kirill Terekhov committed
366
	AdaptiveMesh::AdaptiveMesh(Mesh & _m) : m(&_m)
367
	{
Kirill Terekhov's avatar
Kirill Terekhov committed
368
		model = NULL;
369
		//create a tag that stores maximal refinement level of each element
Kirill Terekhov's avatar
Kirill Terekhov committed
370
		level = m->CreateTag("REFINEMENT_LEVEL",DATA_INTEGER,CELL|FACE|EDGE|NODE|ESET,NONE,1);
371
		tag_status = m->CreateTag("TAG_STATUS",DATA_INTEGER,CELL|FACE|EDGE|NODE,NONE,1);
Kirill Terekhov's avatar
Kirill Terekhov committed
372
373
		//tag_an = m->CreateTag("TAG_AN",DATA_INTEGER,CELL|FACE|EDGE|NODE,NONE,1);
		//ref_tag = m->CreateTag("REF",DATA_REFERENCE,CELL|FACE|EDGE|NODE,NONE);
374
		//create a tag that stores links to all the hanging nodes of the cell
Kirill Terekhov's avatar
Kirill Terekhov committed
375
		hanging_nodes = m->CreateTag("HANGING_NODES",DATA_REFERENCE,CELL|FACE,NONE);
376
		//create a tag that stores links to sets
Kirill Terekhov's avatar
Kirill Terekhov committed
377
		parent_set = m->CreateTag("PARENT_SET",DATA_REFERENCE,CELL,NONE,1);
378
379
	    size = m->GetProcessorsNumber();
    	rank = m->GetProcessorRank();
380
381
382
383
384
385
386
387
388
389
	}
	
	AdaptiveMesh::~AdaptiveMesh()
	{
		//do not delete tags, user may want to repetitively use this class
		//as extension of class mesh in limited code span
	}
	
	bool AdaptiveMesh::Refine(TagInteger & indicator)
	{
Kirill Terekhov's avatar
Kirill Terekhov committed
390
        std::cout << rank << " enter " << __FUNCTION__ << std::endl;
391
392
393
394
395
396
397
		static int call_counter = 0;
		int ret = 0; //return number of refined cells
		//initialize tree structure
		PrepareSet();
		int schedule_counter = 1; //indicates order in which refinement will be scheduled
		int scheduled = 1; //indicates that at least one element was scheduled on current sweep
		//0. Extend indicator for edges and faces
Kirill Terekhov's avatar
Kirill Terekhov committed
398
		indicator = m->CreateTag(indicator.GetTagName(),DATA_INTEGER,FACE|EDGE,NONE,1);
399
400
401
		while(scheduled)
		{
			//1.Communicate indicator - it may be not synced
Kirill Terekhov's avatar
Kirill Terekhov committed
402
			m->ExchangeData(indicator,CELL,0);
403
404
			//2.Propogate indicator down to the faces,edges
			//  select schedule for them
Kirill Terekhov's avatar
Kirill Terekhov committed
405
			for(Storage::integer it = 0; it < m->CellLastLocalID(); ++it) if( m->isValidCell(it) )
406
			{
Kirill Terekhov's avatar
Kirill Terekhov committed
407
				Cell c = m->CellByLocalID(it);
408
409
410
411
412
413
414
415
416
417
418
				if( indicator[c] == schedule_counter )
				{
					ElementArray<Element> adj = c.getAdjElements(FACE|EDGE);
					for(ElementArray<Element>::size_type kt = 0; kt < adj.size(); ++kt)
					{
						if( level[adj[kt]] == level[c] ) //do not schedule finer or coarser elements
							indicator[adj[kt]] = schedule_counter; //refine together with current cell
					}
				}
			}
			//3.Communicate indicator on faces and edges
Kirill Terekhov's avatar
Kirill Terekhov committed
419
			m->ExchangeData(indicator,FACE|EDGE,0);
420
421
422
423
			//4.Check for each cell if there is
			//  any hanging node with adjacent in a need to refine,
			//  schedule for refinement earlier.
			scheduled = 0;
Kirill Terekhov's avatar
Kirill Terekhov committed
424
			for(Storage::integer it = 0; it < m->CellLastLocalID(); ++it) if( m->isValidCell(it) )
425
			{
Kirill Terekhov's avatar
Kirill Terekhov committed
426
				Cell c = m->CellByLocalID(it);
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
				//already scheduled cells may be required to be refined first
				//if( indicator[c] == 0 ) //some optimization
				{
					bool scheduled_c = false;
					//any finer level edge is scheduled to be refined first
					ElementArray<Edge> edges = c->getEdges();
					for(ElementArray<Edge>::size_type kt = 0; kt < edges.size() && !scheduled_c; ++kt)
					{
						//if a finer edge is scheduled
						//then this cell should be refined first
						if( indicator[edges[kt]] != 0 &&
							level[edges[kt]] > level[c] &&
							indicator[edges[kt]] >= indicator[c] )
						{
							indicator[c] = schedule_counter+1;
							scheduled++;
							scheduled_c = true;
						}
					}
				}
			}
			//5.Go back to 1 until no new elements scheduled
Kirill Terekhov's avatar
Kirill Terekhov committed
449
			scheduled = m->Integrate(scheduled);
450
451
			if( scheduled ) schedule_counter++;
		}
452
453
		m->ExchangeData(indicator,CELL | FACE | EDGE,0);
		m->Save("indicator.pmf");
454
		//6.Refine
Kirill Terekhov's avatar
Kirill Terekhov committed
455
		m->BeginModification();
456
457
458
459
		while(schedule_counter)
		{
			Storage::real xyz[3] = {0,0,0};
			//7.split all edges of the current schedule
Kirill Terekhov's avatar
Kirill Terekhov committed
460
			for(Storage::integer it = 0; it < m->EdgeLastLocalID(); ++it) if( m->isValidEdge(it) )
461
			{
Kirill Terekhov's avatar
Kirill Terekhov committed
462
				Edge e = m->EdgeByLocalID(it);
463
464
465
466
467
				if( !e.Hidden() && indicator[e] == schedule_counter )
				{
					//remember adjacent faces that should get information about new hanging node
					ElementArray<Face> edge_faces = e.getFaces();
					//location on the center of the edge
Kirill Terekhov's avatar
Kirill Terekhov committed
468
					for(Storage::integer d = 0; d < m->GetDimensions(); ++d)
469
470
471
						xyz[d] = (e.getBeg().Coords()[d]+e.getEnd().Coords()[d])*0.5;
					//todo: request transformation of node location according to geometrical model
					//create middle node
Kirill Terekhov's avatar
Kirill Terekhov committed
472
					Node n = m->CreateNode(xyz);
473
					//set increased level for new node
474
					level[n] = level[e.getBeg()] = level[e.getEnd()] = level[e]+1;
475
476
477
478
					//for each face provide link to a new hanging node
					for(ElementArray<Face>::size_type kt = 0; kt < edge_faces.size(); ++kt)
						hanging_nodes[edge_faces[kt]].push_back(n);
					//split the edge by the middle node
Kirill Terekhov's avatar
Kirill Terekhov committed
479
					ElementArray<Edge> new_edges = Edge::SplitEdge(e,ElementArray<Node>(m,1,n.GetHandle()),0);
480
481
482
483
484
					//set increased level for new edges
					level[new_edges[0]] = level[new_edges[1]] = level[e]+1;
				}
			}
			//8.split all faces of the current schedule, using hanging nodes on edges
Kirill Terekhov's avatar
Kirill Terekhov committed
485
			for(Storage::integer it = 0; it < m->FaceLastLocalID(); ++it) if( m->isValidFace(it) )
486
			{
Kirill Terekhov's avatar
Kirill Terekhov committed
487
				Face f = m->FaceByLocalID(it);
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
				if( !f.Hidden() && indicator[f] == schedule_counter )
				{
					//connect face center to hanging nodes of the face
					Storage::reference_array face_hanging_nodes = hanging_nodes[f];
					//remember adjacent cells that should get information about new hanging node
					//and new hanging edges
					ElementArray<Cell> face_cells = f.getCells();
					//create node at face center
					//f->Centroid(xyz);
					for(int d = 0; d < 3; ++d) xyz[d] = 0.0;
					for(Storage::reference_array::size_type kt = 0; kt < face_hanging_nodes.size(); ++kt)
						for(int d = 0; d < 3; ++d) xyz[d] += face_hanging_nodes[kt].getAsNode().Coords()[d];
					for(int d = 0; d < 3; ++d) xyz[d] /= (Storage::real)face_hanging_nodes.size();
					//todo: request transformation of node location according to geometrical model
					//create middle node
Kirill Terekhov's avatar
Kirill Terekhov committed
503
					Node n = m->CreateNode(xyz);
504
					//set increased level for the new node
505
					level[n] = level[f]+1;
506
507
508
					//for each cell provide link to new hanging node
					for(ElementArray<Face>::size_type kt = 0; kt < face_cells.size(); ++kt)
						hanging_nodes[face_cells[kt]].push_back(n);
Kirill Terekhov's avatar
Kirill Terekhov committed
509
510
					ElementArray<Node> edge_nodes(m,2); //to create new edges
					ElementArray<Edge> hanging_edges(m,face_hanging_nodes.size());
511
512
513
514
					edge_nodes[0] = n;
					for(Storage::reference_array::size_type kt = 0; kt < face_hanging_nodes.size(); ++kt)
					{
						edge_nodes[1] = face_hanging_nodes[kt].getAsNode();
Kirill Terekhov's avatar
Kirill Terekhov committed
515
						hanging_edges[kt] = m->CreateEdge(edge_nodes).first;
516
517
518
519
520
521
522
523
524
525
526
						//set increased level for new edges
						level[hanging_edges[kt]] = level[f]+1;
					}
					//split the face by these edges
					ElementArray<Face> new_faces = Face::SplitFace(f,hanging_edges,0);
					//set increased level to new faces
					for(ElementArray<Face>::size_type kt = 0; kt < new_faces.size(); ++kt)
						level[new_faces[kt]] = level[f]+1;
				}
			}
			//this tag helps recreate internal face
Kirill Terekhov's avatar
Kirill Terekhov committed
527
			TagReferenceArray internal_face_edges = m->CreateTag("INTERNAL_FACE_EDGES",DATA_REFERENCE,NODE,NODE,4);
528
			//this marker helps detect edges of current cell only
Kirill Terekhov's avatar
Kirill Terekhov committed
529
			MarkerType mark_cell_edges = m->CreateMarker();
530
			//this marker helps detect nodes hanging on edges of unrefined cell
Kirill Terekhov's avatar
Kirill Terekhov committed
531
			MarkerType mark_hanging_nodes = m->CreateMarker();
532
			//9.split all cells of the current schedule
Kirill Terekhov's avatar
Kirill Terekhov committed
533
			for(Storage::integer it = 0; it < m->CellLastLocalID(); ++it) if( m->isValidCell(it) )
534
			{
Kirill Terekhov's avatar
Kirill Terekhov committed
535
				Cell c = m->CellByLocalID(it);
536
537
538
539
540
541
542
543
544
545
546
				if( !c.Hidden() && indicator[c] == schedule_counter )
				{
					Storage::reference_array cell_hanging_nodes = hanging_nodes[c]; //nodes to be connected
					//create node at cell center
					for(int d = 0; d < 3; ++d) xyz[d] = 0.0;
					for(Storage::reference_array::size_type kt = 0; kt < cell_hanging_nodes.size(); ++kt)
						for(int d = 0; d < 3; ++d) xyz[d] += cell_hanging_nodes[kt].getAsNode().Coords()[d];
					for(int d = 0; d < 3; ++d) xyz[d] /= (Storage::real)cell_hanging_nodes.size();
					//c->Centroid(xyz);
					//todo: request transformation of node location according to geometrical model
					//create middle node
Kirill Terekhov's avatar
Kirill Terekhov committed
547
					Node n = m->CreateNode(xyz);
548
					//set increased level for the new node
549
					level[n] = level[c]+1;
550
551
552
553
554
					//retrive all edges of current face to mark them
					ElementArray<Edge> cell_edges = c.getEdges();
					//mark all edges so that we can retive them later
					cell_edges.SetMarker(mark_cell_edges);
					//connect face center to centers of faces by edges
Kirill Terekhov's avatar
Kirill Terekhov committed
555
556
					ElementArray<Node> edge_nodes(m,2);
					ElementArray<Edge> edges_to_faces(m,cell_hanging_nodes.size());
557
558
559
560
561
562
					edge_nodes[0] = n;
					for(Storage::reference_array::size_type kt = 0; kt < cell_hanging_nodes.size(); ++kt)
					{
						assert(cell_hanging_nodes[kt].isValid());
						//todo: unmark hanging node on edge if no more cells depend on it
						edge_nodes[1] = cell_hanging_nodes[kt].getAsNode();
Kirill Terekhov's avatar
Kirill Terekhov committed
563
						edges_to_faces[kt] = m->CreateEdge(edge_nodes).first;
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
						//set increased level for new edges
						level[edges_to_faces[kt]] = level[c]+1;
						//for each node other then the hanging node of the face
						//(this is hanging node on the edge)
						//we record a pair of edges to reconstruct internal faces
						ElementArray<Edge> hanging_edges = cell_hanging_nodes[kt].getEdges(mark_cell_edges,0);
						for(ElementArray<Edge>::size_type lt = 0; lt < hanging_edges.size(); ++lt)
						{
							//get hanging node on the edge
							assert(hanging_edges[lt].getBeg() == cell_hanging_nodes[kt] || hanging_edges[lt].getEnd() == cell_hanging_nodes[kt]);
							Node v = hanging_edges[lt].getBeg() == cell_hanging_nodes[kt]? hanging_edges[lt].getEnd() : hanging_edges[lt].getBeg();
							//mark so that we can collect all of them
							v.SetMarker(mark_hanging_nodes);
							//fill the edges
							Storage::reference_array face_edges = internal_face_edges[v];
							//fill first two in forward order
							//this way we make a closed loop
							assert(face_edges[0] == InvalidElement() || face_edges[2] == InvalidElement());
							if( face_edges[0] == InvalidElement() )
							{
								face_edges[0] = edges_to_faces[kt];
								face_edges[1] = hanging_edges[lt];
							}
							else //last two in reverse
							{
								assert(face_edges[2] ==InvalidElement());
								face_edges[2] = hanging_edges[lt];
								face_edges[3] = edges_to_faces[kt];
							}
						}
					}
					//remove marker from cell edges
					cell_edges.RemMarker(mark_cell_edges);
					//now we have to create internal faces
					ElementArray<Node> edge_hanging_nodes = c.getNodes(mark_hanging_nodes,0);
Kirill Terekhov's avatar
Kirill Terekhov committed
599
					ElementArray<Face> internal_faces(m,edge_hanging_nodes.size());
600
601
602
603
604
605
606
607
608
609
					//unmark hanging nodes on edges
					edge_hanging_nodes.RemMarker(mark_hanging_nodes);
					for(ElementArray<Node>::size_type kt = 0; kt < edge_hanging_nodes.size(); ++kt)
					{
						//create a face based on collected edges
						Storage::reference_array face_edges = internal_face_edges[edge_hanging_nodes[kt]];
						assert(face_edges[0].isValid());
						assert(face_edges[1].isValid());
						assert(face_edges[2].isValid());
						assert(face_edges[3].isValid());
Kirill Terekhov's avatar
Kirill Terekhov committed
610
						internal_faces[kt] = m->CreateFace(ElementArray<Edge>(m,face_edges.begin(),face_edges.end())).first;
611
612
613
614
615
616
617
618
						//set increased level
						level[internal_faces[kt]] = level[c]+1;
						//clean up structure, so that other cells can use it
						edge_hanging_nodes[kt].DelData(internal_face_edges);
					}
					//split the cell
					ElementArray<Cell> new_cells = Cell::SplitCell(c,internal_faces,0);
					//retrive parent set
Kirill Terekhov's avatar
Kirill Terekhov committed
619
					ElementSet parent(m,parent_set[c]);
620
621
622
					//create set corresponding to old coarse cell
					std::stringstream set_name;
					set_name << parent.GetName() << "_C" << c.GlobalID(); //rand may be unsafe
Kirill Terekhov's avatar
Kirill Terekhov committed
623
					ElementSet cell_set = m->CreateSetUnique(set_name.str()).first;
624
625
626
627
628
629
630
631
632
633
634
635
636
					level[cell_set] = level[c]+1;
					//set up increased level for the new cells
					for(ElementArray<Cell>::size_type kt = 0; kt < new_cells.size(); ++kt)
					{
						level[new_cells[kt]] = level[c]+1;
						cell_set.PutElement(new_cells[kt]);
						parent_set[new_cells[kt]] = cell_set.GetHandle();
					}
					parent.AddChild(cell_set);
					//increment number of refined cells
					ret++;
				}
			}
Kirill Terekhov's avatar
Kirill Terekhov committed
637
638
639
			m->ReleaseMarker(mark_hanging_nodes);
			m->ReleaseMarker(mark_cell_edges);
			m->DeleteTag(internal_face_edges);
640
641
642
			//10.jump to later schedule, and go to 7.
			schedule_counter--;
		}
SilverLife's avatar
SilverLife committed
643

644
		//free created tag
Kirill Terekhov's avatar
Kirill Terekhov committed
645
		m->DeleteTag(indicator,FACE|EDGE);
SilverLife's avatar
SilverLife committed
646

647
		/*
648
649
        MarkerType marker_new = m->CreateMarker();
        for(Mesh::iteratorCell it = m->BeginCell(); it != m->EndCell(); ++it) 
SilverLife's avatar
SilverLife committed
650
        {
651
            if (it->GetMarker(m->NewMarker()) == false) continue;
652
653
654
655
            it->SetMarker(marker_new);

        }

656
        for(Mesh::iteratorFace it = m->BeginFace(); it != m->EndFace(); ++it) 
657
        {
658
            if (it->GetMarker(m->NewMarker()) == false) continue;
659
660
            it->SetMarker(marker_new);
        }
SilverLife's avatar
SilverLife committed
661

662
        for(Mesh::iteratorEdge it = m->BeginEdge(); it != m->EndEdge(); ++it) 
663
        {
664
            if (it->GetMarker(m->NewMarker()) == false) continue;
665
            it->SetMarker(marker_new);
SilverLife's avatar
SilverLife committed
666
        }
667

668
        for(Mesh::iteratorNode it = m->BeginNode(); it != m->EndNode(); ++it) 
SilverLife's avatar
SilverLife committed
669
        {
670
            if (it->GetMarker(m->NewMarker()) == false) continue;
671
            it->SetMarker(marker_new);
SilverLife's avatar
SilverLife committed
672
        }
673
        */
SilverLife's avatar
SilverLife committed
674
675


676
		//11. Restore parallel connectivity, global ids
Kirill Terekhov's avatar
Kirill Terekhov committed
677
        
SilverLife's avatar
SilverLife committed
678
        //if (call_counter == 0)
Kirill Terekhov's avatar
Kirill Terekhov committed
679
		m->ResolveModification();
680
        //ExchangeGhost(3,NODE); // Construct Ghost cells in 2 layers connected via nodes
681
682
		//12. Let the user update their data
		//todo: call back function for New() cells
Kirill Terekhov's avatar
Kirill Terekhov committed
683
		if( model ) model->Adaptation(*m);
684
		//13. Delete old elements of the mesh
Kirill Terekhov's avatar
Kirill Terekhov committed
685
		m->ApplyModification();
Kirill Terekhov's avatar
Kirill Terekhov committed
686
687
		
		m->ExchangeGhost(1,NODE,m->NewMarker());
688
		//14. Done
Kirill Terekhov's avatar
Kirill Terekhov committed
689
        //cout << rank << ": Before end " << std::endl;
Kirill Terekhov's avatar
Kirill Terekhov committed
690
		m->EndModification();
691
		//ExchangeData(hanging_nodes,CELL | FACE,0);
Kirill Terekhov's avatar
Kirill Terekhov committed
692
        //m->ResolveSets();
693

694
		m->CheckCentroids();
695

Kirill Terekhov's avatar
Kirill Terekhov committed
696
697
698
699
700
701
        //m->BeginModification();
        //    m->ExchangeGhost(1,NODE,marker_new); // Construct Ghost cells in 2 layers connected via nodes
        //    m->ReleaseMarker(marker_new,CELL|FACE|EDGE|NODE);
		//m->ApplyModification();
    	//m->EndModification();
    	//PrintSet();
702
    	m->ExchangeData(parent_set,CELL,0);
Kirill Terekhov's avatar
Kirill Terekhov committed
703
704
705
706
707
708
709
710
711
712
713
714
715
    	
    			//restore face orientation
		//BUG: bad orientation not fixed automatically
		int nfixed = 0;
		for(Mesh::iteratorFace it = m->BeginFace(); it != m->EndFace(); ++it) 
			if( !it->CheckNormalOrientation() )
			{
				it->FixNormalOrientation();
				nfixed++;
			}
			//std::cout << "Face " << it->LocalID() << " oriented incorrectly " << std::endl;
		if( nfixed ) std::cout << "fixed " << nfixed << " faces" << std::endl;

716
717

        //ExchangeData(hanging_nodes,CELL | FACE,0);
Kirill Terekhov's avatar
Kirill Terekhov committed
718
        //cout << rank << ": After end " << std::endl;
719
		//reorder element's data to free up space
Kirill Terekhov's avatar
Kirill Terekhov committed
720
		m->ReorderEmpty(CELL|FACE|EDGE|NODE);
721
722
		//return number of refined cells
		call_counter++;
Kirill Terekhov's avatar
Kirill Terekhov committed
723
        std::cout << rank << " exit " << __FUNCTION__ << std::endl;
724
725
		return ret != 0;
	}
726
727
728
729
730
731
732
733
734
735
736
737

    void OperationMin(const Tag & tag, const Element & element, const INMOST_DATA_BULK_TYPE * data, INMOST_DATA_ENUM_TYPE size)
    {
        int value  =  (int)*((int*)data);


        if (value < element->Integer(tag))
        {
            element->Integer(tag) = value;
        }
        (void)size;
    }
738
	
739
740
    void AdaptiveMesh::SynchronizeIndicated(TagInteger& indicator)
    {
741
742
        if (m->GetProcessorsNumber() == 1) return;
        int rank = m->GetProcessorRank();
743
744

        // Check all sets. All elements in sets must be indicated. At first we check indicator in local processor, and second integrate data
745
746
        TagInteger tag_indicated = m->CreateTag("INDICATED",DATA_INTEGER,ESET,NONE,1);
        for(Mesh::iteratorSet it = m->BeginSet(); it != m->EndSet(); ++it) 
747
        {
748
            ElementSet set = ElementSet(m,*it);
749
750
751
752
753
754
755
            set.Integer(tag_indicated) = 1;
            ElementSet::iterator p = set.Begin();
            while(p != set.End())
            {
                if (indicator[*p] == 0)
                {
                    tag_indicated[set] = 0;
756
                    //std::cout << rank << ": Set " << set.GetName() << " not all indicated" << endl;
757
758
759
760
761
762
763
                    break;
                }

                p++;
            }
        }

764
765
        m->ReduceData(tag_indicated,ESET,0,OperationMin);
        m->ExchangeData(tag_indicated,ESET,0);
766

767
        for(Mesh::iteratorSet it = m->BeginSet(); it != m->EndSet(); ++it) 
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
            if (it->Integer(tag_indicated) == 0)
            {
                ElementSet::iterator p = it->Begin();
                while(p != it->End())
                {
                    p->Integer(indicator) = 0;
                    p++;
                }
            }
        /*
                stringstream ss;
        for(Mesh::iteratorSet it = BeginSet(); it != EndSet(); ++it) 
        {
            ss << it->GetName() << " - " << it->Integer(tag_indicated) << endl;;
        }
783
        cout << rank << " Sets: \n" << ss.str() << endl;
784
785
786
        */
    }

787
788
	bool AdaptiveMesh::Coarse(TagInteger & indicator)
	{
Kirill Terekhov's avatar
Kirill Terekhov committed
789
        std::cout << rank << " enter " << __FUNCTION__ << std::endl;
790
791
792
        SynchronizeIndicated(indicator);
        return false;

793
794
795
796
797
798
799
800
		static int call_counter = 0;
		//return number of coarsened cells
		int ret = 0;
		//initialize tree structure
		PrepareSet();
		int schedule_counter = 1; //indicates order in which refinement will be scheduled
		int scheduled = 1, unscheduled = 0; //indicates that at least one element was scheduled on current sweep
		//TagInteger coarsened = CreateTag("COARSENED",DATA_INTEGER,CELL,NONE,1);
Kirill Terekhov's avatar
Kirill Terekhov committed
801
		TagInteger coarse_indicator = m->CreateTag("COARSE_INDICATOR",DATA_INTEGER,EDGE,NONE,1); //used to find on fine cells indicator on coarse cells
802
		//0. Extend indicator for sets, edges and faces
Kirill Terekhov's avatar
Kirill Terekhov committed
803
		indicator = m->CreateTag(indicator.GetTagName(),DATA_INTEGER,FACE|EDGE,NONE,1);
804
805
806
807
808
809
810
811
		while(scheduled || unscheduled)
		{
			// rules
			// a) If there is adjacent finer edge that is not marked for coarsening
			// then this cell should not be coarsened
			// b) If there is adjacent coarser cell, then this cell should be coarsened
			// first
			//0.Communicate indicator - it may be not synced
Kirill Terekhov's avatar
Kirill Terekhov committed
812
			m->ExchangeData(indicator,CELL,0);
813
814
815
816
817
818
819
			//1. Mark each adjacent face/edge for coarsement schedule
			// problem: should mark so that if every adjacent cell is coarsened
			// then adjacent face/edge are also coarsened
			for(ElementType etype = EDGE; etype <= FACE; etype = NextElementType(etype))
			{
				//for(Storage::integer it = 0; it < LastLocalID(etype); ++it) if( isValidElement(etype,it) )
				//	indicator[ElementByLocalID(etype,it)] = 0;
Kirill Terekhov's avatar
Kirill Terekhov committed
820
				for(Storage::integer it = 0; it < m->LastLocalID(etype); ++it) if( m->isValidElement(etype,it) )
821
				{
Kirill Terekhov's avatar
Kirill Terekhov committed
822
					Element e = m->ElementByLocalID(etype,it);
823
824
825
826
					ElementArray<Cell> adj = e.getCells();
					indicator[e] = INT_MAX;
					for(ElementArray<Element>::size_type kt = 0; kt < adj.size(); ++kt)
						if( level[e] == level[adj[kt]]) indicator[e] = std::min(indicator[e],indicator[adj[kt]]);
827
					//if (indicator[e] == INT_MAX) cout << rank << ": " << ElementTypeName(e.GetElementType()) << e.GlobalID() << endl;
Kirill Terekhov's avatar
Kirill Terekhov committed
828
					//assert(indicator[e] != INT_MAX);
829
830
831
				}
			}
			//2.Communicate indicator on faces and edges
Kirill Terekhov's avatar
Kirill Terekhov committed
832
			m->ReduceData(indicator,FACE|EDGE,0,ReduceMin);
833
			m->ExchangeData(indicator,FACE|EDGE,0);
834
835
836
			//3.If there is adjacent finer edge that are not marked for coarsening
			// then this cell should not be coarsened
			unscheduled = scheduled = 0;
Kirill Terekhov's avatar
Kirill Terekhov committed
837
			for(Storage::integer it = 0; it < m->CellLastLocalID(); ++it) if( m->isValidCell(it) )
838
			{
Kirill Terekhov's avatar
Kirill Terekhov committed
839
				Cell c = m->CellByLocalID(it);
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
				if( indicator[c] )
				{
					ElementArray<Edge> edges = c.getEdges();
					for(ElementArray<Edge>::size_type kt = 0; kt < edges.size(); ++kt)
					{
						if( level[edges[kt]] > level[c] && indicator[edges[kt]] == 0 )
						{
							indicator[c] = 0;
							unscheduled++;
						}
					}
				}
			}
			//4. Propogate coarsement info over set tree to detect valid coarsenings.
			// go down over sets, if set does not have children and all of the cells
			// of the set are marked for coarsening, then mark the set for coarsement
			// otherwise unmark.
			// Unmark all cells that are not to be coarsened
Kirill Terekhov's avatar
Kirill Terekhov committed
858
			for(Storage::integer it = 0; it < m->CellLastLocalID(); ++it) if( m->isValidCell(it) )
859
			{
Kirill Terekhov's avatar
Kirill Terekhov committed
860
				Cell c = m->CellByLocalID(it);
861
                //if (!isValidElement(c.GetHandle())) continue;
862
863
				if( indicator[c] )
				{
Kirill Terekhov's avatar
Kirill Terekhov committed
864
					ElementSet parent(m,parent_set[c]);
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
					//intermediate cell may not be coarsened
					//root set may not have coarsening cells
					if( parent.HaveChild() || !parent.HaveParent() )
					{
						indicator[c] = 0;
						unscheduled++;
					}
					else
					{
						Storage::integer schedule_first = 0;
						bool check = true;
						//check that all elements of the set are to be coarsened
						for(ElementSet::iterator it = parent.Begin(); it != parent.End(); ++it)
						{
							check &= (indicator[it->self()] != 0);
							schedule_first = std::max(schedule_first,indicator[it->self()]);
						}
						if(!check)
						{
							indicator[c] = 0;
							unscheduled++;
						}
						else if( indicator[c] != schedule_first )
						{
							indicator[c] = schedule_first;
							unscheduled++;
						}
					}
				}
			}
			//5.If there is an adjacent coarser element to be refined, then
			//   this one should be scheduled to be refined first
			//a) clean up coarse indicator tag
Kirill Terekhov's avatar
Kirill Terekhov committed
898
899
			for(Storage::integer it = 0; it < m->EdgeLastLocalID(); ++it) if( m->isValidEdge(it) )
				coarse_indicator[m->EdgeByLocalID(it)] = 0;
900
			//b) each cell mark it's finer edges with cell's schedule
Kirill Terekhov's avatar
Kirill Terekhov committed
901
			for(Storage::integer it = 0; it < m->CellLastLocalID(); ++it) if( m->isValidCell(it) )
902
			{
Kirill Terekhov's avatar
Kirill Terekhov committed
903
				Cell c = m->CellByLocalID(it);
904
905
906
907
908
909
910
911
912
913
914
				if( indicator[c] )
				{
					ElementArray<Element> adj = c.getAdjElements(EDGE);
					for(ElementArray<Element>::size_type kt = 0; kt < adj.size(); ++kt)
					{
						if( level[adj[kt]] > level[c] ) //only finer edges
							coarse_indicator[adj[kt]] = std::max(coarse_indicator[adj[kt]],indicator[c]);
					}
				}
			}
			//c) data reduction to get maximum over mesh partition
Kirill Terekhov's avatar
Kirill Terekhov committed
915
			m->ReduceData(coarse_indicator,EDGE,0,ReduceMax);
916
			m->ExchangeData(coarse_indicator,EDGE,0);
917
			//d) look from cells if any edge is coarsened earlier
Kirill Terekhov's avatar
Kirill Terekhov committed
918
			for(Storage::integer it = 0; it < m->CellLastLocalID(); ++it) if( m->isValidCell(it) )
919
			{
Kirill Terekhov's avatar
Kirill Terekhov committed
920
				Cell c = m->CellByLocalID(it);
921
922
923
924
925
926
927
928
929
930
931
932
933
934
				if( indicator[c] )
				{
					ElementArray<Element> adj = c.getAdjElements(EDGE);
					for(ElementArray<Element>::size_type kt = 0; kt < adj.size(); ++kt)
					{
						if( level[c] == level[adj[kt]] && //do not look from coarse cell onto finer edge
						    indicator[c] <= coarse_indicator[adj[kt]])
						{
							indicator[c] = coarse_indicator[adj[kt]]+1;
							scheduled++;
						}
					}
				}
			}
935
			m->ExchangeData(indicator,CELL|FACE|EDGE,0);
936
			//5.Go back to 1 until no new elements scheduled
Kirill Terekhov's avatar
Kirill Terekhov committed
937
938
			scheduled = m->Integrate(scheduled);
			unscheduled = m->Integrate(unscheduled);
939
940
941
			if( scheduled ) schedule_counter++;
		}
		//cleanup
Kirill Terekhov's avatar
Kirill Terekhov committed
942
		coarse_indicator = m->DeleteTag(coarse_indicator);
943
		//Make schedule which elements should be refined earlier.
Kirill Terekhov's avatar
Kirill Terekhov committed
944
		m->BeginModification();
945
946
947
948
949
950
		while(schedule_counter)
		{
			//unite cells
			//should find and set hanging nodes on faces
			//find single node at the center, all other nodes,
			//adjacent over edge are hanging nodes
Kirill Terekhov's avatar
Kirill Terekhov committed
951
			for(Storage::integer it = 0; it < m->CellLastLocalID(); ++it) if( m->isValidCell(it) )
952
			{
Kirill Terekhov's avatar
Kirill Terekhov committed
953
				Cell c = m->CellByLocalID(it);
954
955
956
				if( !c.Hidden() && indicator[c] == schedule_counter )
				{
					//this set contains all the cells to be united
Kirill Terekhov's avatar
Kirill Terekhov committed
957
958
					ElementSet parent(m,parent_set[c]);
					ElementArray<Cell> unite_cells(m,parent.Size());
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
					//unmark indicator to prevent coarsement with next element
					Storage::integer kt = 0;
					for(ElementSet::iterator jt = parent.Begin(); jt != parent.End(); ++jt)
					{
						unite_cells[kt++] = jt->getAsCell();
						indicator[jt->self()] = 0; //prevent algorithm from visiting again
					}
					//find a node common to all the cells
					ElementArray<Node> center_node = unite_cells[0].getNodes();
					for(kt = 1; kt < unite_cells.size(); ++kt)
						center_node.Intersect(unite_cells[kt].getNodes());
					//only one should be found
					assert(center_node.size() == 1);
					ElementArray<Node> hanging = center_node[0].BridgeAdjacencies2Node(EDGE);
					Cell v = Cell::UniteCells(unite_cells,0);
					//connect hanging nodes to the cell
					assert(hanging_nodes[v].size() == 0);
					for(ElementArray<Node>::size_type kt = 0; kt < hanging.size(); ++kt)
						hanging_nodes[v].push_back(hanging[kt]);
					//set new parent
					parent_set[v] = parent.GetParent().GetHandle();
					//add cell to parent set
Kirill Terekhov's avatar
Kirill Terekhov committed
981
					ElementSet(m,parent_set[v]).PutElement(v);
982
983
984
985
986
987
988
989
990
991
992
993
994
995
					//set level for new cell
					level[v] = level[c]-1;
					//delete set that contained cells
					//tree structure should be resolved on ApplyModification
					parent.DeleteSet();
					//increment number of coarsened cells
					ret++;
				}
			}
			//unite faces
			//should find and set hanging nodes on edges
			//find single node at the center, all other nodes,
			//adjacent over edge of the face are hanging nodes
			int numcoarsened = 0;
Kirill Terekhov's avatar
Kirill Terekhov committed
996
			for(Storage::integer it = 0; it < m->FaceLastLocalID(); ++it) if( m->isValidFace(it) )
997
			{
Kirill Terekhov's avatar
Kirill Terekhov committed
998
				Face f = m->FaceByLocalID(it);
999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
				if( !f.Hidden() && indicator[f] == schedule_counter )
				{
					//one (or both) of the adjacent cells were coarsened and has lower level
					bool visited = false;
					ElementArray<Cell> cells = f.getCells();
					for(ElementArray<Cell>::size_type kt = 0; kt < cells.size(); ++kt)
					{
						assert(level[cells[kt]] < level[f]);
					}
					for(ElementArray<Cell>::size_type kt = 0; kt < cells.size(); ++kt)
					{
						if( level[cells[kt]] < level[f] )
						{
							//cell has one hanging node in common with current face
							ElementArray<Node> nodes = f.getNodes();
							Storage::reference_array search_hanging = hanging_nodes[cells[kt]];
							nodes.Intersect(search_hanging.data(),search_hanging.size());
							assert(nodes.size() == 1);
							//faces that hanging node shares with the cell are
							//those to be united
							ElementArray<Face> unite_faces = cells[kt].getFaces();
							unite_faces.Intersect(nodes[0].getFaces());
							//unmark faces to prevent visit
							for(ElementArray<Face>::size_type lt = 0; lt < unite_faces.size(); ++lt)
								indicator[unite_faces[lt]] = 0;
							//nodes connected by edges to hanging node and
							//common to the cell are hanging nodes on edges
							ElementArray<Node> hanging = cells[kt].getNodes();
							hanging.Intersect(nodes[0].BridgeAdjacencies(EDGE,NODE));
							//unite faces
							Face v = Face::UniteFaces(unite_faces,0);
							//set level for new face
							level[v] = level[f]-1;
							//connect new face to hanging nodes
							for(ElementArray<Node>::size_type lt = 0; lt < hanging.size(); ++lt)
								hanging_nodes[v].push_back(hanging[lt]);
							visited = true;
							numcoarsened++;
							break; //no need to visit the other cell
						}
					}
					assert(visited);
				}
			}
			//unite edges
Kirill Terekhov's avatar
Kirill Terekhov committed
1044
			for(Storage::integer it = 0; it < m->EdgeLastLocalID(); ++it) if( m->isValidEdge(it) )
1045
			{
Kirill Terekhov's avatar
Kirill Terekhov committed
1046
				Edge e = m->EdgeByLocalID(it);
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
				if( !e.Hidden() && indicator[e] == schedule_counter )
				{
					//at least one face must have lower level
					bool visited = false;
					ElementArray<Face> faces = e.getFaces();
					for(ElementArray<Face>::size_type kt = 0; kt < faces.size(); ++kt)
					{
						if( level[faces[kt]] < level[e] )
						{
							//face has one hanging node in common with current edge
							ElementArray<Node> nodes = e.getNodes();
							Storage::reference_array search_hanging = hanging_nodes[faces[kt]];
							nodes.Intersect(search_hanging.data(),search_hanging.size());
							assert(nodes.size() == 1);
							//edges that hanging node shares with the face are those to
							//be united
							ElementArray<Edge> unite_edges = faces[kt].getEdges();
							unite_edges.Intersect(nodes[0].getEdges());
							//unmark edges to prevent visit
							for(ElementArray<Edge>::size_type lt = 0; lt < unite_edges.size(); ++lt)
								indicator[unite_edges[lt]] = 0;
							//unite edges
							Edge v = Edge::UniteEdges(unite_edges,0);
							//set level for new edge
							level[v] = level[e]-1;
							visited = true;
							break; //no need to visit any other face
						}
					}
					assert(visited);
				}
			}
Kirill Terekhov's avatar
Kirill Terekhov committed
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
			/*
			for(Storage::integer it = 0; it < NodeLastLocalID(); ++it) if( isValidNode(it) )
			{
				Node e = NodeByLocalID(it);
				if( !e.Hidden() )
				{
					int my_level = -1;
					ElementArray<Edge> edges = e.getEdges();
					for(ElementArray<Edge>::iterator kt = edges.begin(); kt != edges.end(); ++kt)
						my_level = std::max(my_level,level[*kt]);
					level[e] = my_level;
				}
			}
			*/
1093
1094
1095
1096
			//jump to later schedule
			schedule_counter--;
		}
		//free created tag
Kirill Terekhov's avatar
Kirill Terekhov committed
1097
		m->DeleteTag(indicator,FACE|EDGE);
1098
		//todo:
Kirill Terekhov's avatar
Kirill Terekhov committed
1099
		m->ResolveModification();
1100
1101
		//todo:
		//let the user update their data
Kirill Terekhov's avatar
Kirill Terekhov committed
1102
1103
		if( model ) model->Adaptation(*m);
		m->ApplyModification();
1104
		//done
Kirill Terekhov's avatar
Kirill Terekhov committed
1105
		m->EndModification();
Kirill Terekhov's avatar
Kirill Terekhov committed
1106
1107
		
		m->CheckCentroids();
1108
		//CheckCentroids();
Kirill Terekhov's avatar