File: itkQuadEdge.h

package info (click to toggle)
insighttoolkit5 5.4.3-5
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid, trixie
  • size: 704,384 kB
  • sloc: cpp: 783,592; ansic: 628,724; xml: 44,704; fortran: 34,250; python: 22,874; sh: 4,078; pascal: 2,636; lisp: 2,158; makefile: 464; yacc: 328; asm: 205; perl: 203; lex: 146; tcl: 132; javascript: 98; csh: 81
file content (441 lines) | stat: -rw-r--r-- 15,511 bytes parent folder | download
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
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
/*=========================================================================
 *
 *  Copyright NumFOCUS
 *
 *  Licensed under the Apache License, Version 2.0 (the "License");
 *  you may not use this file except in compliance with the License.
 *  You may obtain a copy of the License at
 *
 *         https://www.apache.org/licenses/LICENSE-2.0.txt
 *
 *  Unless required by applicable law or agreed to in writing, software
 *  distributed under the License is distributed on an "AS IS" BASIS,
 *  WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 *  See the License for the specific language governing permissions and
 *  limitations under the License.
 *
 *=========================================================================*/
#ifndef itkQuadEdge_h
#define itkQuadEdge_h

#include "itkQuadEdgeMeshBaseIterator.h"
#include "ITKQuadEdgeMeshExport.h"

#include "itkMacro.h"

// Debugging macros for classes that do not derive from the itkObject.
// FIXME: Maybe variations of these macros should be moved into
// itkMacro.h
//
#define itkQEDebugMacro(x)                                                                              \
  {                                                                                                     \
    std::ostringstream itkmsg;                                                                          \
    itkmsg << "Debug: In " __FILE__ ", line " << __LINE__ << '\n' << " (" << this << "): " x << "\n\n"; \
    OutputWindowDisplayDebugText(itkmsg.str().c_str());                                                 \
  }                                                                                                     \
  ITK_MACROEND_NOOP_STATEMENT
#define itkQEWarningMacro(x)                                                                              \
  {                                                                                                       \
    std::ostringstream itkmsg;                                                                            \
    itkmsg << "WARNING: In " __FILE__ ", line " << __LINE__ << '\n' << " (" << this << "): " x << "\n\n"; \
    OutputWindowDisplayWarningText(itkmsg.str().c_str());                                                 \
  }                                                                                                       \
  ITK_MACROEND_NOOP_STATEMENT

// -------------------------------------------------------------------------
/**
 * Macro that defines overloaded members for the second order
 * topological accessors.
 *
 * @param st Superclass type.
 * @param pt Primal edge type.
 * @param dt Dual edge type.
 * \todo Should this macro be added to doxygen macros?
 */
#define itkQEAccessorsMacro(st, pt, dt)                                                          \
  pt * GetOnext() { return (dynamic_cast<pt *>(this->st::GetOnext())); }                         \
                                                                                                 \
  dt * GetRot() { return (dynamic_cast<dt *>(this->st::GetRot())); }                             \
                                                                                                 \
  pt * GetSym() { return (dynamic_cast<pt *>(this->st::GetSym())); }                             \
                                                                                                 \
  pt * GetLnext() { return (dynamic_cast<pt *>(this->st::GetLnext())); }                         \
                                                                                                 \
  pt * GetRnext() { return (dynamic_cast<pt *>(this->st::GetRnext())); }                         \
                                                                                                 \
  pt * GetDnext() { return (dynamic_cast<pt *>(this->st::GetDnext())); }                         \
                                                                                                 \
  pt * GetOprev() { return (dynamic_cast<pt *>(this->st::GetOprev())); }                         \
                                                                                                 \
  pt * GetLprev() { return (dynamic_cast<pt *>(this->st::GetLprev())); }                         \
                                                                                                 \
  pt * GetRprev() { return (dynamic_cast<pt *>(this->st::GetRprev())); }                         \
                                                                                                 \
  pt * GetDprev() { return (dynamic_cast<pt *>(this->st::GetDprev())); }                         \
                                                                                                 \
  dt * GetInvRot() { return (dynamic_cast<dt *>(this->st::GetInvRot())); }                       \
                                                                                                 \
  pt * GetInvOnext() { return (dynamic_cast<pt *>(this->st::GetInvOnext())); }                   \
                                                                                                 \
  pt * GetInvLnext() { return (dynamic_cast<pt *>(this->st::GetInvLnext())); }                   \
                                                                                                 \
  pt * GetInvRnext() { return (dynamic_cast<pt *>(this->st::GetInvRnext())); }                   \
                                                                                                 \
  pt *       GetInvDnext() { return (dynamic_cast<pt *>(this->st::GetInvDnext())); }             \
  const pt * GetOnext() const { return (dynamic_cast<const pt *>(this->st::GetOnext())); }       \
                                                                                                 \
  const dt * GetRot() const { return (dynamic_cast<const dt *>(this->st::GetRot())); }           \
                                                                                                 \
  const pt * GetSym() const { return (dynamic_cast<const pt *>(this->st::GetSym())); }           \
                                                                                                 \
  const pt * GetLnext() const { return (dynamic_cast<const pt *>(this->st::GetLnext())); }       \
                                                                                                 \
  const pt * GetRnext() const { return (dynamic_cast<const pt *>(this->st::GetRnext())); }       \
                                                                                                 \
  const pt * GetDnext() const { return (dynamic_cast<const pt *>(this->st::GetDnext())); }       \
                                                                                                 \
  const pt * GetOprev() const { return (dynamic_cast<const pt *>(this->st::GetOprev())); }       \
                                                                                                 \
  const pt * GetLprev() const { return (dynamic_cast<const pt *>(this->st::GetLprev())); }       \
                                                                                                 \
  const pt * GetRprev() const { return (dynamic_cast<const pt *>(this->st::GetRprev())); }       \
                                                                                                 \
  const pt * GetDprev() const { return (dynamic_cast<const pt *>(this->st::GetDprev())); }       \
                                                                                                 \
  const dt * GetInvRot() const { return (dynamic_cast<const dt *>(this->st::GetInvRot())); }     \
                                                                                                 \
  const pt * GetInvOnext() const { return (dynamic_cast<const pt *>(this->st::GetInvOnext())); } \
                                                                                                 \
  const pt * GetInvLnext() const { return (dynamic_cast<const pt *>(this->st::GetInvLnext())); } \
                                                                                                 \
  const pt * GetInvRnext() const { return (dynamic_cast<const pt *>(this->st::GetInvRnext())); } \
                                                                                                 \
  const pt * GetInvDnext() const { return (dynamic_cast<const pt *>(this->st::GetInvDnext())); }

namespace itk
{
/**
 * \class QuadEdge
 * \brief Base class for the implementation of a quad-edge data structure as
 * proposed in "Guibas and Stolfi 1985"
 *
 * \author Alexandre Gouaillard, Leonardo Florez-Valencia, Eric Boix
 *
 * This implementation was contributed as a paper to the Insight Journal
 * https://www.insight-journal.org/browse/publication/122
 *
 * \sa "Accessing adjacent edges."
 *
 * \ingroup MeshObjects
 * \ingroup ITKQuadEdgeMesh
 */

class ITKQuadEdgeMesh_EXPORT QuadEdge
{
public:
  /** Hierarchy type alias & values. */
  using Self = QuadEdge;

  /** Iterator types. */
  using Iterator = QuadEdgeMeshIterator<Self>;
  using ConstIterator = QuadEdgeMeshConstIterator<Self>;

  /** Basic iterators methods. */
  inline itkQEDefineIteratorMethodsMacro(Onext);
  // itkQEDefineIteratorMethodsMacro( Sym );
  // itkQEDefineIteratorMethodsMacro( Lnext );
  // itkQEDefineIteratorMethodsMacro( Rnext );
  // itkQEDefineIteratorMethodsMacro( Dnext );
  // itkQEDefineIteratorMethodsMacro( Oprev );
  // itkQEDefineIteratorMethodsMacro( Lprev );
  // itkQEDefineIteratorMethodsMacro( Rprev );
  // itkQEDefineIteratorMethodsMacro( Dprev );
  // itkQEDefineIteratorMethodsMacro( InvOnext );
  // itkQEDefineIteratorMethodsMacro( InvLnext );
  // itkQEDefineIteratorMethodsMacro( InvRnext );
  // itkQEDefineIteratorMethodsMacro( InvDnext );

  /** Object creation methods. */
  QuadEdge();
  QuadEdge(const QuadEdge &) = default;
  QuadEdge(QuadEdge &&) = default;
  QuadEdge &
  operator=(const QuadEdge &) = default;
  QuadEdge &
  operator=(QuadEdge &&) = default;
  virtual ~QuadEdge();

  /** Sub-algebra Set methods. */
  inline void
  SetOnext(Self * onext)
  {
    this->m_Onext = onext;
  }
  inline void
  SetRot(Self * rot)
  {
    this->m_Rot = rot;
  }

  /** Sub-algebra Get methods.
   *  Returns edge with same Origin (see
   *  "Accessing adjacent edges"). */
  inline Self *
  GetOnext()
  {
    return this->m_Onext;
  }
  inline Self *
  GetRot()
  {
    return this->m_Rot;
  }
  inline const Self *
  GetOnext() const
  {
    return this->m_Onext;
  }
  inline const Self *
  GetRot() const
  {
    return this->m_Rot;
  }

  /**
   * \brief Basic quad-edge topological method.
   *
   * This method describes all possible topological operations on an edge.
   *
   * It is its own inverse. It works in two ways:
   *
   *   1. If this->GetOrg() != b->GetOrg(), it slice a face in two.
   *   2. If this->GetOrg() == b->GetOrg(), it unifies two faces.
   *
   * \warning This class only handles of the connectivity and is not aware
   *    of the geometry that lies at the \ref GeometricalQuadEdge level.
   *    It is strongly discouraged to use this method. Instead you should
   *    use itk::QuadEdgeMesh::Splice its geometry aware version.
   *
   */
  // TODO fix this ref
  //   * \sa \ref DoxySurgeryConnectivity
  inline void
  Splice(Self * b)
  {
    Self * aNext = this->GetOnext();
    Self * bNext = b->GetOnext();
    Self * alpha = aNext->GetRot();
    Self * beta = bNext->GetRot();
    Self * alphaNext = alpha->GetOnext();
    Self * betaNext = beta->GetOnext();

    this->SetOnext(bNext);
    b->SetOnext(aNext);
    alpha->SetOnext(betaNext);
    beta->SetOnext(alphaNext);
  }

  //  Second order accessors.

  /** Returns the symmetric edge
   * (see "Accessing adjacent edges"). */
  inline Self *
  GetSym()
  {
    if (this->m_Rot)
    {
      return (this->m_Rot->m_Rot);
    }
    return (this->m_Rot);
  }

  inline const Self *
  GetSym() const
  {
    if (this->m_Rot)
    {
      return (this->m_Rot->m_Rot);
    }
    return (this->m_Rot);
  }

  /** Returns next edge with same Left face
   * (see "Accessing adjacent edges"). */
  Self *
  GetLnext();

  const Self *
  GetLnext() const;

  /** Returns next edge with same Right face. The first edge
   * encountered when moving counter-clockwise from e around e->Right.
   * (see "Accessing adjacent edges"). */
  Self *
  GetRnext();

  const Self *
  GetRnext() const;

  /** Returns next edge with same right face and same Destination. The
   *  first edge encountered when moving counter-clockwise from e
   *  (see "Accessing adjacent edges"). */
  Self *
  GetDnext();

  const Self *
  GetDnext() const;

  /** Returns previous edge with same Origin
   *  (see "Accessing adjacent edges"). */
  Self *
  GetOprev();

  const Self *
  GetOprev() const;

  /** Returns previous edge with same Left face. The first edge
   *  encountered when moving clockwise from e around e->Left.
   * (see "Accessing adjacent edges"). */
  Self *
  GetLprev();

  const Self *
  GetLprev() const;

  /** Returns the previous edge with same Right face. The first edge
   *  encountered when moving clockwise from e around e->Right.
   *  (see "Accessing adjacent edges"). */
  Self *
  GetRprev();

  const Self *
  GetRprev() const;

  /** Returns the previous edge with same Right face and same Destination.
   *  The first edge encountered when moving clockwise from e around e->Dest.
   *  (see "Accessing adjacent edges"). */
  Self *
  GetDprev();

  const Self *
  GetDprev() const;

  /** Inverse operators */
  inline Self *
  GetInvRot()
  {
#ifdef NDEBUG
    return (this->GetRot()->GetRot()->GetRot());
#else
    Self * p1 = this->GetRot();
    if (!p1)
    {
      return nullptr;
    }
    Self * p2 = p1->GetRot();
    if (!p2)
    {
      return nullptr;
    }
    Self * p3 = p2->GetRot();
    if (!p3)
    {
      return nullptr;
    }
    return p3;
#endif
  }

  inline Self *
  GetInvOnext()
  {
    return this->GetOprev();
  }
  inline Self *
  GetInvLnext()
  {
    return this->GetLprev();
  }
  inline Self *
  GetInvRnext()
  {
    return this->GetRprev();
  }
  inline Self *
  GetInvDnext()
  {
    return this->GetDprev();
  }
  inline const Self *
  GetInvRot() const
  {
#ifdef NDEBUG
    return (this->GetRot()->GetRot()->GetRot());
#else
    const Self * p1 = this->GetRot();
    if (!p1)
    {
      return nullptr;
    }
    const Self * p2 = p1->GetRot();
    if (!p2)
    {
      return nullptr;
    }
    const Self * p3 = p2->GetRot();
    if (!p3)
    {
      return nullptr;
    }
    return p3;
#endif
  }

  inline const Self *
  GetInvOnext() const
  {
    return this->GetOprev();
  }
  inline const Self *
  GetInvLnext() const
  {
    return this->GetLprev();
  }
  inline const Self *
  GetInvRnext() const
  {
    return this->GetRprev();
  }
  inline const Self *
  GetInvDnext() const
  {
    return this->GetDprev();
  }

  /** Queries. */
  inline bool
  IsHalfEdge() const
  {
    return ((m_Onext == this) || (m_Rot == nullptr));
  }
  inline bool
  IsIsolated() const
  {
    return (this == this->GetOnext());
  }
  bool
  IsEdgeInOnextRing(Self * testEdge) const;

  bool
  IsLnextGivenSizeCyclic(const int size) const;

  unsigned int
  GetOrder() const;

private:
  Self * m_Onext{}; /**< Onext ring */
  Self * m_Rot{};   /**< Rot ring */
};
} // namespace itk

#endif