1
  2
  3
  4
  5
  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
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
#include "meshkit/Mesh.hpp"

using namespace Jaal;

///////////////////////////////////////////////////////////////////////////////
Point3D
LaplaceSmoothing::displace( const Point3D &head, const Point3D &tail, double r )
{
   double d = Math::length( head, tail);
   if( d < 1.0E-10) return head;

   Vec3D  vec = Math::unit_vector(head, tail);

   Point3D newpos;
   newpos[0] = tail[0] + d*r*vec[0];
   newpos[1] = tail[1] + d*r*vec[1];
   newpos[2] = tail[2] + d*r*vec[2];
   return newpos;
}

///////////////////////////////////////////////////////////////////////////////

double
LaplaceSmoothing::update_vertex_position(Vertex *vertex, const Point3D &newpos)
{
    double area0, area1, localerror = 0.0;

    NodeSequence vneighs;
    vertex->getRelations( vneighs );

    Point3D oldpos = vertex->getXYZCoords();

    FaceSequence vfaces;
    vertex->getRelations( vfaces );

    area0 = 0.0;
    for (size_t i = 0; i < vfaces.size(); i++)
    {
        MeshEntity::idtype id = vfaces[i]->getID();
        area0 += facearea[id];
    }

    // Change the coordinate ( temporary )
    vertex->setXYZCoords(newpos);

    // Check for validity of the sounding patch...
    int some_face_inverted = 0;
    area1 = 0.0;
    for (size_t i = 0; i < vfaces.size(); i++)
    {
        MeshEntity::idtype id = vfaces[i]->getID();
        facearea[id] = vfaces[i]->getArea(); // Recalculate new face area ...
        area1 += facearea[id];
        if (vfaces[i]->concaveAt() >= 0)
        {
            some_face_inverted = 1;
            break;
        }
    }

    // Both the area must be invariant and no face must inverte in order to update the
    // postion.
    if (fabs(area1 - area0) > 1.0E-10 || some_face_inverted == 1)
    {
        vertex->setXYZCoords(oldpos); // Revert back
        localerror = 0.0;
        return localerror;
    }

    // Update the area of the surrounding faces ...
    localerror = max(localerror, fabs(newpos[0] - oldpos[0]));
    localerror = max(localerror, fabs(newpos[1] - oldpos[1]));
    localerror = max(localerror, fabs(newpos[2] - oldpos[2]));
    maxerror = max(maxerror, localerror);

    return localerror;
}

///////////////////////////////////////////////////////////////////////////////

double
LaplaceSmoothing::update_vertex_position(Vertex *vertex)
{
    if (vertex->isConstrained()) return 0.0;

    const Point3D &oldpos = vertex->getXYZCoords();

    NodeSequence neighs;
    vertex->getRelations( neighs );
    assert(neighs.size());

    Point3D newpos, xyz;
    newpos[0] = 0.0;
    newpos[1] = 0.0;
    newpos[2] = 0.0;

    double weight, sum_weight = 0.0;<--- The scope of the variable 'weight' can be reduced.
    for (size_t i = 0; i < neighs.size(); i++)
    {
        weight = lapweight->get(vertex, neighs[i]);
        xyz = neighs[i]->getXYZCoords();
        newpos[0] += weight * xyz[0];
        newpos[1] += weight * xyz[1];
        newpos[2] += weight * xyz[2];
        sum_weight += weight;
    }

    newpos[0] /= sum_weight;
    newpos[1] /= sum_weight;
    newpos[2] /= sum_weight;

    newpos[0] = (1.0 - lambda) * oldpos[0] + lambda * newpos[0];
    newpos[1] = (1.0 - lambda) * oldpos[1] + lambda * newpos[1];
    newpos[2] = (1.0 - lambda) * oldpos[2] + lambda * newpos[2];

    return update_vertex_position(vertex, newpos);
}

///////////////////////////////////////////////////////////////////////////////
int
LaplaceSmoothing::execute()
{
  return global_smoothing();
}

///////////////////////////////////////////////////////////////////////////////

int
LaplaceSmoothing::global_smoothing()
{
    assert(lapweight);
    mesh->search_boundary();

    int relexist0 = mesh->build_relations(0, 0);
    int relexist2 = mesh->build_relations(0, 2);

    size_t numnodes = mesh->getSize(0);
    size_t numfaces = mesh->getSize(2);

    facearea.resize(numfaces);
    size_t num_inverted_before_smoothing = 0;
    for (size_t i = 0; i < numfaces; i++)
    {
        Face *face = mesh->getFaceAt(i);
        face->setID(i); // Needed because of facearea is an  external array...
        facearea[i] = face->getArea();
        if (face->concaveAt() >= 0) num_inverted_before_smoothing++;
    }

    for (int iter = 0; iter < numIters; iter++)
    {
        maxerror = 0.0;
        for (size_t i = 0; i < numnodes; i++)
        {
            Vertex *v = mesh->getNodeAt(i);
            if( !v->isRemoved() ) 
                maxerror = max(maxerror, update_vertex_position(v));
        }
        cout << " iter " << maxerror << endl;
 
        if (maxerror < 1.0E-06) break;
    }

    if (!relexist0) mesh->clear_relations(0, 0);
    if (!relexist2) mesh->clear_relations(0, 2);

/*
    size_t num_inverted_after_smoothing = 0;
    for (size_t i = 0; i < numfaces; i++)
    {
        Face *face = mesh->getFaceAt(i);
        if (face->invertedAt() >= 0) num_inverted_after_smoothing++;
    }
    assert(num_inverted_after_smoothing <= num_inverted_before_smoothing);
*/

    return 0;
}

///////////////////////////////////////////////////////////////////////////////

int
LaplaceSmoothing::localized_at(const NodeSequence &vertexQ)
{
    assert(lapweight);

    assert( mesh->isBoundaryKnown() );
    assert( mesh->getAdjTable(0,0)  );
    assert( mesh->getAdjTable(0,2)  );

/*
    int relexist0 = mesh->build_relations(0, 0);
    int relexist2 = mesh->build_relations(0, 2);
*/

    //How many faces will be affected by changing the coordinates of vertexQ

    FaceSequence vfaces;
    size_t numfaces = mesh->getSize(2);

    for (size_t i = 0; i < numfaces; i++)
    {
        Face *face = mesh->getFaceAt(i); // assert( face );
        face->setVisitMark(0);
    }

    for (size_t i = 0; i < vertexQ.size(); i++)
    {
        Vertex *v = vertexQ[i];
        v->getRelations( vfaces );
        for (size_t j = 0; j < vfaces.size(); j++)
            vfaces[j]->setVisitMark(1);
    }

    facearea.resize(numfaces);
    for (size_t i = 0; i < numfaces; i++)
    {
        Face *face = mesh->getFaceAt(i);
        face->setID(i); // Needed because of facearea is an  external array...
        facearea[i] = 0.0;
        if (face->isVisited())
            facearea[i] = face->getArea();
    }

    for (int iter = 0; iter < numIters; iter++)
    {
        maxerror = 0.0;
        for (size_t i = 0; i < vertexQ.size(); i++)
            maxerror = max(maxerror, update_vertex_position(vertexQ[i]));
        if (maxerror < 1.0E-06) break;
    }

    int status = 0;
    for (size_t i = 0; i < numfaces; i++)
    {
        Face *face = mesh->getFaceAt(i);
        if (face->isVisited() && face->concaveAt() >= 0)
        {
            status = 1;
            break;
        }
    }

/*
    if (!relexist0) mesh->clear_relations(0, 0);
    if (!relexist2) mesh->clear_relations(0, 2);
*/

    return status;
}

///////////////////////////////////////////////////////////////////////////////

int
LaplaceSmoothing::convexify()<--- The function 'convexify' is never used.
{
    if (mesh->isHomogeneous() != 4) return 1;
    assert( mesh->isPruned() );

    int relexist0 = mesh->build_relations(0, 0);
    int relexist2 = mesh->build_relations(0, 2);

    size_t numnodes = mesh->getSize(0);
    size_t numfaces = mesh->getSize(2);

    facearea.resize(numfaces);
    for (size_t i = 0; i < numfaces; i++)
    {
        Face *face = mesh->getFaceAt(i);
        face->setID(i); // Needed because of facearea is an  external array...
        facearea[i] = face->getArea();
    }

    NodeSequence fixnodes;
    double r = 0.5;

    size_t ncount = 0;
    for (size_t iface = 0; iface < numfaces; iface++)
    {
        Face *face = mesh->getFaceAt(iface);
        int pos = face->concaveAt();
        if (pos >= 0)
        {
            Vertex *v0 = face->getNodeAt((pos + 0) % 4);
            if (!v0->isBoundary())
            {
                ncount++;
                fixnodes.clear();
                // Constrained the face nodes ..
                for (int j = 0; j < face->getSize(0); j++)
                {
                    Vertex *vertex = mesh->getNodeAt(j);
                    if (!vertex->isConstrained())
                    {
                        vertex->setConstrainedMark(1);
                        fixnodes.push_back(vertex);
                    }
                }

                Vertex *v1 = face->getNodeAt((pos + 1) % 4);
                Vertex *v2 = face->getNodeAt((pos + 2) % 4);
                Vertex *v3 = face->getNodeAt((pos + 3) % 4);

                Point3D pm ;
                Vertex::mid_point(v1, v3, pm, r);
                Point3D newpos = displace( pm, v2->getXYZCoords(), 1.0001);

                v0->setXYZCoords(newpos);

                // Upate the remaining nodes...
                for (size_t i = 0; i < numnodes; i++)
                    update_vertex_position(mesh->getNodeAt(i));
                // unconstrained the face nodes ..
                for (size_t j = 0; j < fixnodes.size(); j++)
                    fixnodes[j]->setConstrainedMark(0);
            }
        }
    }

    if (ncount) {
        cout << "#of Concave faces " << ncount << endl;
        global_smoothing();
    }

    if (!relexist0) mesh->clear_relations(0, 0);
    if (!relexist2) mesh->clear_relations(0, 2);

    ncount = mesh->count_concave_faces();
    
    if (ncount)
    {
        cout << "Warning: Laplacian could not eliminate concave faces " << ncount << endl;
        return 1;
    } 
    return 0;
}

////////////////////////////////////////////////////////////////////////////////



/*
double
LaplaceSmoothing::angle_based_update (const LVertex &lnode)
{
  //
  // Presently this works only for 2D case where z = 0.0;
  //
  Vertex *vertex = lnode.apex;
  if (vertex->isConstrained ()) return 0.0;

  map<Vertex*, vector<Vertex*> >::const_iterator it;
  Point3D p0 = vertex->getXYZCoords ();
  double x = p0[0];
  double y = p0[1];
  double xsum = 0.0;
  double ysum = 0.0;
  for (it = lnode.neighs.begin (); it != lnode.neighs.end (); ++it)
    {
      Vertex *v1 = it->first;
      vector<Vertex*> vneighs = it->second;
      assert (vneighs.size () == 2);
      Point3D pj = v1->getXYZCoords ();
      Point3D pp = vneighs[0]->getXYZCoords ();   // Right side of pj
      Point3D pm = vneighs[1]->getXYZCoords ();   // Left  side of  pj
      Vec3D vec0 = Math::create_vector (p0, pj);
      Vec3D vec1 = Math::create_vector (pp, pj);
      Vec3D vec2 = Math::create_vector (pm, pj);
      double a1 = Math::getVectorAngle (vec0, vec1, ANGLE_IN_RADIANS);
      double b1 = Math::getVectorAngle (vec0, vec2, ANGLE_IN_RADIANS);
      double t  = 0.5 * (b1 - a1);
      double x0 = pj[0];
      double y0 = pj[1];
      double xn = x0 + (x - x0) * cos (t) - (y - y0) * sin (t);
      double yn = y0 + (x - x0) * sin (t) + (y - y0) * cos (t);
      xsum += xn;
      ysum += xn;
    }
  int nsize = lnode.neighs.size ();
  Point3D newpos;
  newpos[0] = xsum / (double) nsize;
  newpos[1] = ysum / (double) nsize;
  newpos[2] = 0.0;
  return update_vertex_position (vertex, newpos);
}

///////////////////////////////////////////////////////////////////////////////

void
LaplaceSmoothing::build_angle_based_neighbors ()
{
  size_t numnodes = mesh->getSize (0);
  lnodes.clear ();
  lnodes.reserve(numnodes);
  LVertex lnode;
  for (size_t inode = 0; inode < numnodes; inode++)
    {
      Vertex *vertex = mesh->getNodeAt (inode);
      if (!vertex->isBoundary ())
        {
          lnode.apex = vertex;
          lnode.neighs.clear();
          vector<Face*> vfaces = vertex->getRelations2 ();
          for (size_t j = 0; j < vfaces.size (); j++)
            {
              Face *face = vfaces[j];
              int pos = face->queryPosOf (vertex);
              Vertex *v1 = face->getNodeAt ((pos + 1) % 4);
              Vertex *v2 = face->getNodeAt ((pos + 2) % 4);
              Vertex *v3 = face->getNodeAt ((pos + 3) % 4);
              lnode.neighs[v1].push_back (v2);
              lnode.neighs[v2].push_back (v1);
              lnode.neighs[v3].push_back (v2);
              lnode.neighs[v2].push_back (v3);
            }
            lnodes.push_back (lnode);
        }
    }
}
 */