ModHausdorffT.cc 12.7 KB
Newer Older
Jan Möbius's avatar
Jan Möbius committed
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
/*===========================================================================*\
 *                                                                           *
 *                               OpenMesh                                    *
 *      Copyright (C) 2001-2011 by Computer Graphics Group, RWTH Aachen      *
 *                           www.openmesh.org                                *
 *                                                                           *
 *---------------------------------------------------------------------------*
 *  This file is part of OpenMesh.                                           *
 *                                                                           *
 *  OpenMesh is free software: you can redistribute it and/or modify         *
 *  it under the terms of the GNU Lesser General Public License as           *
 *  published by the Free Software Foundation, either version 3 of           *
 *  the License, or (at your option) any later version with the              *
 *  following exceptions:                                                    *
 *                                                                           *
 *  If other files instantiate templates or use macros                       *
 *  or inline functions from this file, or you compile this file and         *
 *  link it with other files to produce an executable, this file does        *
 *  not by itself cause the resulting executable to be covered by the        *
 *  GNU Lesser General Public License. This exception does not however       *
 *  invalidate any other reasons why the executable file might be            *
 *  covered by the GNU Lesser General Public License.                        *
 *                                                                           *
 *  OpenMesh is distributed in the hope that it will be useful,              *
 *  but WITHOUT ANY WARRANTY; without even the implied warranty of           *
 *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the            *
 *  GNU Lesser General Public License for more details.                      *
 *                                                                           *
 *  You should have received a copy of the GNU LesserGeneral Public          *
 *  License along with OpenMesh.  If not,                                    *
 *  see <http://www.gnu.org/licenses/>.                                      *
 *                                                                           *
\*===========================================================================*/

/*===========================================================================*\
 *                                                                           *
 *   $Revision: 448 $                                                        *
 *   $Date: 2011-11-04 13:59:37 +0100 (Fri, 04 Nov 2011) $                   *
 *                                                                           *
\*===========================================================================*/

/** \file ModHausdorffT.cc
 */


//=============================================================================
//
//  CLASS ModHausdorffT - IMPLEMENTATION
//
//=============================================================================

52
#define OPENMESH_DECIMATER_MODHAUSDORFFT_C
Jan Möbius's avatar
Jan Möbius committed
53
54
55
56
57


//== INCLUDES =================================================================

#include "ModHausdorffT.hh"
58
59
60
#ifdef USE_OPENMP
#include <omp.h>
#endif
Jan Möbius's avatar
Jan Möbius committed
61
62
63
64
65
66
67
68
69


//== NAMESPACES ===============================================================

namespace OpenMesh  {
namespace Decimater {

//== IMPLEMENTATION ==========================================================

70
71
72
template <class MeshT>
typename ModHausdorffT<MeshT>::Scalar
ModHausdorffT<MeshT>::
Jan Möbius's avatar
Jan Möbius committed
73
74
75
76
77
distPointTriangleSquared( const Point& _p,
                          const Point& _v0,
                          const Point& _v1,
                          const Point& _v2,
                          Point& _nearestPoint )
Jan Möbius's avatar
Jan Möbius committed
78
{
79
80
81
82
  const Point v0v1 = _v1 - _v0;
  const Point v0v2 = _v2 - _v0;
  const Point n = v0v1 % v0v2; // not normalized !
  const double d = n.sqrnorm();
Jan Möbius's avatar
Jan Möbius committed
83
84
85
86


  // Check if the triangle is degenerated
  if (d < FLT_MIN && d > -FLT_MIN) {
87
88
89
//    std::cerr << "distPointTriangleSquared: Degenerated triangle !\n";
//    std::cerr << "Points are : " << _v0 << " " << _v1 << " " << _v2 << std::endl;
//    std::cerr << "d is " << d << std::endl;
Jan Möbius's avatar
Jan Möbius committed
90
91
    return -1.0;
  }
92
  const double invD = 1.0 / d;
Jan Möbius's avatar
Jan Möbius committed
93
94
95
96


  // these are not needed for every point, should still perform
  // better with many points against one triangle
97
98
99
100
  const Point v1v2 = _v2 - _v1;
  const double inv_v0v2_2 = 1.0 / v0v2.sqrnorm();
  const double inv_v0v1_2 = 1.0 / v0v1.sqrnorm();
  const double inv_v1v2_2 = 1.0 / v1v2.sqrnorm();
Jan Möbius's avatar
Jan Möbius committed
101
102


Jan Möbius's avatar
Jan Möbius committed
103
104
  Point v0p = _p - _v0;
  Point t = v0p % n;
Jan Möbius's avatar
Jan Möbius committed
105
  double  s01, s02, s12;
106
107
  const double a = (t | v0v2) * -invD;
  const double b = (t | v0v1) * invD;
Jan Möbius's avatar
Jan Möbius committed
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


  if (a < 0)
  {
    // Calculate the distance to an edge or a corner vertex
    s02 = ( v0v2 | v0p ) * inv_v0v2_2;
    if (s02 < 0.0)
    {
      s01 = ( v0v1 | v0p ) * inv_v0v1_2;
      if (s01 <= 0.0) {
        v0p = _v0;
      } else if (s01 >= 1.0) {
        v0p = _v1;
      } else {
        v0p = _v0 + v0v1 * s01;
      }
    } else if (s02 > 1.0) {
      s12 = ( v1v2 | ( _p - _v1 )) * inv_v1v2_2;
      if (s12 >= 1.0) {
        v0p = _v2;
      } else if (s12 <= 0.0) {
        v0p = _v1;
      } else {
        v0p = _v1 + v1v2 * s12;
      }
    } else {
      v0p = _v0 + v0v2 * s02;
    }
  } else if (b < 0.0) {
    // Calculate the distance to an edge or a corner vertex
    s01 = ( v0v1 | v0p ) * inv_v0v1_2;
    if (s01 < 0.0)
    {
141
  const Point n = v0v1 % v0v2; // not normalized !
Jan Möbius's avatar
Jan Möbius committed
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
      s02 = ( v0v2 |  v0p ) * inv_v0v2_2;
      if (s02 <= 0.0) {
        v0p = _v0;
      } else if (s02 >= 1.0) {
        v0p = _v2;
      } else {
        v0p = _v0 + v0v2 * s02;
      }
    } else if (s01 > 1.0) {
      s12 = ( v1v2 | ( _p - _v1 )) * inv_v1v2_2;
      if (s12 >= 1.0) {
        v0p = _v2;
      } else if (s12 <= 0.0) {
        v0p = _v1;
      } else {
        v0p = _v1 + v1v2 * s12;
      }
    } else {
      v0p = _v0 + v0v1 * s01;
    }
  } else if (a+b > 1.0) {
    // Calculate the distance to an edge or a corner vertex
    s12 = ( v1v2 | ( _p - _v1 )) * inv_v1v2_2;
    if (s12 >= 1.0) {
      s02 = ( v0v2 | v0p ) * inv_v0v2_2;
      if (s02 <= 0.0) {
        v0p = _v0;
      } else if (s02 >= 1.0) {
        v0p = _v2;
      } else {
        v0p = _v0 + v0v2*s02;
      }
    } else if (s12 <= 0.0) {
      s01 = ( v0v1 |  v0p ) * inv_v0v1_2;
      if (s01 <= 0.0) {
        v0p = _v0;
      } else if (s01 >= 1.0) {
        v0p = _v1;
      } else {
        v0p = _v0 + v0v1 * s01;
      }
    } else {
      v0p = _v1 + v1v2 * s12;
    }
  } else {
    // Calculate the distance to an interior point of the triangle
    _nearestPoint = _p - n*((n|v0p) * invD);
    return (_nearestPoint - _p).sqrnorm();
  }

  _nearestPoint = v0p;

  return (_nearestPoint - _p).sqrnorm();
}


198
template <class MeshT>
Jan Möbius's avatar
Jan Möbius committed
199
void
200
ModHausdorffT<MeshT>::
Jan Möbius's avatar
Jan Möbius committed
201
202
203
204
205
206
207
208
209
210
211
212
initialize()
{
  typename Mesh::FIter  f_it(mesh_.faces_begin()), f_end(mesh_.faces_end());

  for (; f_it!=f_end; ++f_it)
    mesh_.property(points_, f_it).clear();
}


//-----------------------------------------------------------------------------


213
template <class MeshT>
Jan Möbius's avatar
Jan Möbius committed
214
float
215
ModHausdorffT<MeshT>::
Jan Möbius's avatar
Jan Möbius committed
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
collapse_priority(const CollapseInfo& _ci)
{
  static Points                  points;  points.clear();
  std::vector<FaceHandle>        faces;   faces.reserve(20);
  typename Mesh::VertexFaceIter  vf_it;
  typename Mesh::FaceHandle      fh;
  typename Mesh::Scalar          sqr_tolerace = tolerance_*tolerance_;
  typename Mesh::Point           dummy;
  typename Mesh::CFVIter         fv_it;
  bool                           ok;

  // collect all points to be tested
  // collect all faces to be tested against
  for (vf_it=mesh_.vf_iter(_ci.v0); vf_it; ++vf_it) {
    fh = vf_it.handle();

    if (fh != _ci.fl && fh != _ci.fr)
      faces.push_back(fh);

    Points& pts = mesh_.property(points_, fh);
    std::copy(pts.begin(), pts.end(), std::back_inserter(points));
  }

  // add point to be removed
  points.push_back(_ci.p0);

  // setup iterators
  typename std::vector<FaceHandle>::iterator  fh_it, fh_end(faces.end());
  typename Points::const_iterator             p_it, p_end(points.end());


  // simulate collapse
  mesh_.set_point(_ci.v0, _ci.p1);

  // for each point: try to find a face such that error is < tolerance
  ok = true;
252

Jan Möbius's avatar
Jan Möbius committed
253
254
255
256
257
258
259
260
  for (p_it=points.begin(); ok && p_it!=p_end; ++p_it) {
    ok = false;

    for (fh_it=faces.begin(); !ok && fh_it!=fh_end; ++fh_it) {
      const Point& p0 = mesh_.point(fv_it=mesh_.cfv_iter(*fh_it));
      const Point& p1 = mesh_.point(++fv_it);
      const Point& p2 = mesh_.point(++fv_it);

Jan Möbius's avatar
Jan Möbius committed
261
      if (  distPointTriangleSquared(*p_it, p0, p1, p2, dummy) <= sqr_tolerace)
Jan Möbius's avatar
Jan Möbius committed
262
263
264
265
266
267
268
269
270
271
272
273
274
275
        ok = true;
    }
  }

  // undo simulation changes
  mesh_.set_point(_ci.v0, _ci.p0);

  return ( ok ? Base::LEGAL_COLLAPSE : Base::ILLEGAL_COLLAPSE );
}


//-----------------------------------------------------------------------------


276
template <class MeshT>
Jan Möbius's avatar
Jan Möbius committed
277
void
278
ModHausdorffT<MeshT>::
Jan Möbius's avatar
Jan Möbius committed
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
postprocess_collapse(const CollapseInfo& _ci)
{
  static Points                  points;
  typename Mesh::VertexFaceIter  vf_it;
  FaceHandle                     fh;
  std::vector<FaceHandle>        faces;


  // collect points & neighboring triangles

  points.clear(); // it's static !
  faces.reserve(20);


  // collect active faces and their points
  for (vf_it=mesh_.vf_iter(_ci.v1); vf_it; ++vf_it) {
    fh = vf_it.handle();
    faces.push_back(fh);

    Points& pts = mesh_.property(points_, fh);
    std::copy(pts.begin(), pts.end(), std::back_inserter(points));
    pts.clear();
  }
  if (faces.empty()) return; // should not happen anyway...


  // collect points of the 2 deleted faces
  if ((fh=_ci.fl).is_valid()) {
    Points& pts = mesh_.property(points_, fh);
    std::copy(pts.begin(), pts.end(), std::back_inserter(points));
    pts.clear();
  }
  if ((fh=_ci.fr).is_valid()) {
    Points& pts = mesh_.property(points_, fh);
    std::copy(pts.begin(), pts.end(), std::back_inserter(points));
    pts.clear();
  }


  // add the deleted point
  points.push_back(_ci.p0);




  // setup iterators
  typename std::vector<FaceHandle>::iterator  fh_it, fh_end(faces.end());
  typename Points::const_iterator             p_it, p_end(points.end());



  // re-distribute points
  Scalar                  emin, e;
  Point                   dummy;
  typename Mesh::CFVIter  fv_it;

  for (p_it=points.begin(); p_it!=p_end; ++p_it) {
    emin = FLT_MAX;

338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
#ifdef USE_OPENMP
    int facesCount = faces.size();
#pragma omp parallel for private(e) shared(emin)
    for (int i = 0; i < facesCount; ++i) {
      const Point& p0 = mesh_.point(fv_it=mesh_.cfv_iter(faces[i]));
      const Point& p1 = mesh_.point(++fv_it);
      const Point& p2 = mesh_.point(++fv_it);

      e =  distPointTriangleSquared(*p_it, p0, p1, p2, dummy);
      if (e < emin) {
        emin = e;
        fh   = faces[i];
      }

    }
#else
Jan Möbius's avatar
Jan Möbius committed
354
355
356
357
358
    for (fh_it=faces.begin(); fh_it!=fh_end; ++fh_it) {
      const Point& p0 = mesh_.point(fv_it=mesh_.cfv_iter(*fh_it));
      const Point& p1 = mesh_.point(++fv_it);
      const Point& p2 = mesh_.point(++fv_it);

Jan Möbius's avatar
Jan Möbius committed
359
      e =  distPointTriangleSquared(*p_it, p0, p1, p2, dummy);
Jan Möbius's avatar
Jan Möbius committed
360
361
362
363
364
365
      if (e < emin) {
        emin = e;
        fh   = *fh_it;
      }

    }
366
#endif
Jan Möbius's avatar
Jan Möbius committed
367
368
369
370
371
372
373
374
375

    mesh_.property(points_, fh).push_back(*p_it);
  }
}


//-----------------------------------------------------------------------------


376
377
378
template <class MeshT>
typename ModHausdorffT<MeshT>::Scalar
ModHausdorffT<MeshT>::
Jan Möbius's avatar
Jan Möbius committed
379
380
381
382
383
384
385
386
387
388
389
390
391
compute_sqr_error(FaceHandle _fh, const Point& _p) const
{
  typename Mesh::CFVIter           fv_it = mesh_.cfv_iter(_fh);
  const Point&                     p0    = mesh_.point(fv_it);
  const Point&                     p1    = mesh_.point(++fv_it);
  const Point&                     p2    = mesh_.point(++fv_it);

  const Points&                    points = mesh_.property(points_, _fh);
  typename Points::const_iterator  p_it   = points.begin();
  typename Points::const_iterator  p_end  = points.end();

  Point  dummy;
  Scalar e;
Jan Möbius's avatar
Jan Möbius committed
392
  Scalar emax =  distPointTriangleSquared(_p, p0, p1, p2, dummy);
Jan Möbius's avatar
Jan Möbius committed
393

394
395
396
397
398
399
400
401
402
403

#ifdef USE_OPENMP
  int pointsCount = points.size();
#pragma omp parallel for private(e) shared(emax)
  for (int i = 0; i < pointsCount; ++i) {
    e =  distPointTriangleSquared(points[i], p0, p1, p2, dummy);
    if (e > emax)
      emax = e;
  }
#else
Jan Möbius's avatar
Jan Möbius committed
404
  for (; p_it!=p_end; ++p_it) {
Jan Möbius's avatar
Jan Möbius committed
405
    e =  distPointTriangleSquared(*p_it, p0, p1, p2, dummy);
Jan Möbius's avatar
Jan Möbius committed
406
407
408
    if (e > emax)
      emax = e;
  }
409
#endif
Jan Möbius's avatar
Jan Möbius committed
410
411
412
413
414
415
416
417
418

  return emax;
}


//=============================================================================
}
}
//=============================================================================