-
Notifications
You must be signed in to change notification settings - Fork 1
/
ArithmeticalDSSFactory_8ih_source.html
422 lines (420 loc) · 42 KB
/
ArithmeticalDSSFactory_8ih_source.html
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
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.9.1"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>DGtal: ArithmeticalDSSFactory.ih Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript" src="navtreedata.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/searchdata.js"></script>
<script type="text/javascript" src="search/search.js"></script>
<script type="text/x-mathjax-config">
MathJax.Hub.Config({
extensions: ["tex2jax.js", "TeX/AMSmath.js", "TeX/AMSsymbols.js"],
jax: ["input/TeX","output/HTML-CSS"],
});
</script>
<script type="text/javascript" async="async" src="https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.3/MathJax.js?config=TeX-MML-AM_CHTML/MathJax.js"></script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr style="height: 56px;">
<td id="projectalign" style="padding-left: 0.5em;">
<div id="projectname">DGtal
 <span id="projectnumber">1.4.2</span>
</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.1 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
var searchBox = new SearchBox("searchBox", "search",false,'Search','.html');
/* @license-end */
</script>
<script type="text/javascript" src="menudata.js"></script>
<script type="text/javascript" src="menu.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
$(function() {
initMenu('',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
});
/* @license-end */</script>
<div id="main-nav"></div>
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
<div id="nav-tree">
<div id="nav-tree-contents">
<div id="nav-sync" class="sync"></div>
</div>
</div>
<div id="splitbar" style="-moz-user-select:none;"
class="ui-resizable-handle">
</div>
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
$(document).ready(function(){initNavTree('ArithmeticalDSSFactory_8ih_source.html',''); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
onmouseover="return searchBox.OnSearchSelectShow()"
onmouseout="return searchBox.OnSearchSelectHide()"
onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>
<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0"
name="MSearchResults" id="MSearchResults">
</iframe>
</div>
<div class="header">
<div class="headertitle">
<div class="title">ArithmeticalDSSFactory.ih</div> </div>
</div><!--header-->
<div class="contents">
<div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> /**</div>
<div class="line"><a name="l00002"></a><span class="lineno"> 2</span>  * This program is free software: you can redistribute it and/or modify</div>
<div class="line"><a name="l00003"></a><span class="lineno"> 3</span>  * it under the terms of the GNU Lesser General Public License as</div>
<div class="line"><a name="l00004"></a><span class="lineno"> 4</span>  * published by the Free Software Foundation, either version 3 of the</div>
<div class="line"><a name="l00005"></a><span class="lineno"> 5</span>  * License, or (at your option) any later version.</div>
<div class="line"><a name="l00006"></a><span class="lineno"> 6</span>  *</div>
<div class="line"><a name="l00007"></a><span class="lineno"> 7</span>  * This program is distributed in the hope that it will be useful,</div>
<div class="line"><a name="l00008"></a><span class="lineno"> 8</span>  * but WITHOUT ANY WARRANTY; without even the implied warranty of</div>
<div class="line"><a name="l00009"></a><span class="lineno"> 9</span>  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the</div>
<div class="line"><a name="l00010"></a><span class="lineno"> 10</span>  * GNU General Public License for more details.</div>
<div class="line"><a name="l00011"></a><span class="lineno"> 11</span>  *</div>
<div class="line"><a name="l00012"></a><span class="lineno"> 12</span>  * You should have received a copy of the GNU General Public License</div>
<div class="line"><a name="l00013"></a><span class="lineno"> 13</span>  * along with this program. If not, see <http://www.gnu.org/licenses/>.</div>
<div class="line"><a name="l00014"></a><span class="lineno"> 14</span>  *</div>
<div class="line"><a name="l00015"></a><span class="lineno"> 15</span>  **/</div>
<div class="line"><a name="l00016"></a><span class="lineno"> 16</span>  </div>
<div class="line"><a name="l00017"></a><span class="lineno"> 17</span> /**</div>
<div class="line"><a name="l00018"></a><span class="lineno"> 18</span>  * @file ArithmeticalDSSFactory.ih</div>
<div class="line"><a name="l00019"></a><span class="lineno"> 19</span>  * @author Tristan Roussillon (\c tristan.roussillon@liris.cnrs.fr )</div>
<div class="line"><a name="l00020"></a><span class="lineno"> 20</span>  * Laboratoire d'InfoRmatique en Image et Systèmes d'information - LIRIS (CNRS, UMR 5205), CNRS, France</div>
<div class="line"><a name="l00021"></a><span class="lineno"> 21</span>  *</div>
<div class="line"><a name="l00022"></a><span class="lineno"> 22</span>  * @date 2013/10/28</div>
<div class="line"><a name="l00023"></a><span class="lineno"> 23</span>  *</div>
<div class="line"><a name="l00024"></a><span class="lineno"> 24</span>  * Implementation of inline methods defined in ArithmeticalDSSFactory.h</div>
<div class="line"><a name="l00025"></a><span class="lineno"> 25</span>  *</div>
<div class="line"><a name="l00026"></a><span class="lineno"> 26</span>  * This file is part of the DGtal library.</div>
<div class="line"><a name="l00027"></a><span class="lineno"> 27</span>  */</div>
<div class="line"><a name="l00028"></a><span class="lineno"> 28</span>  </div>
<div class="line"><a name="l00029"></a><span class="lineno"> 29</span>  </div>
<div class="line"><a name="l00030"></a><span class="lineno"> 30</span> //////////////////////////////////////////////////////////////////////////////</div>
<div class="line"><a name="l00031"></a><span class="lineno"> 31</span> #include <cstdlib></div>
<div class="line"><a name="l00032"></a><span class="lineno"> 32</span>  </div>
<div class="line"><a name="l00033"></a><span class="lineno"> 33</span> #include "DGtal/geometry/curves/ArithmeticalDSSConvexHull.h"</div>
<div class="line"><a name="l00034"></a><span class="lineno"> 34</span> #include "DGtal/kernel/NumberTraits.h"</div>
<div class="line"><a name="l00035"></a><span class="lineno"> 35</span> #include "DGtal/base/OneItemOutputIterator.h"</div>
<div class="line"><a name="l00036"></a><span class="lineno"> 36</span> //////////////////////////////////////////////////////////////////////////////</div>
<div class="line"><a name="l00037"></a><span class="lineno"> 37</span>  </div>
<div class="line"><a name="l00038"></a><span class="lineno"> 38</span> ///////////////////////////////////////////////////////////////////////////////</div>
<div class="line"><a name="l00039"></a><span class="lineno"> 39</span> // IMPLEMENTATION of inline methods.</div>
<div class="line"><a name="l00040"></a><span class="lineno"> 40</span> ///////////////////////////////////////////////////////////////////////////////</div>
<div class="line"><a name="l00041"></a><span class="lineno"> 41</span>  </div>
<div class="line"><a name="l00042"></a><span class="lineno"> 42</span> //-----------------------------------------------------------------------------</div>
<div class="line"><a name="l00043"></a><span class="lineno"> 43</span> template <typename TCoordinate, typename TInteger, unsigned short adjacency></div>
<div class="line"><a name="l00044"></a><span class="lineno"> 44</span> inline</div>
<div class="line"><a name="l00045"></a><span class="lineno"> 45</span> DGtal::ArithmeticalDSS<TCoordinate,TInteger,adjacency></div>
<div class="line"><a name="l00046"></a><span class="lineno"> 46</span> DGtal::ArithmeticalDSSFactory<TCoordinate,TInteger,adjacency>::</div>
<div class="line"><a name="l00047"></a><span class="lineno"> 47</span> createSubsegment(const DSL& aDSL, const Point& aF, const Point& aL)</div>
<div class="line"><a name="l00048"></a><span class="lineno"> 48</span> {</div>
<div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  ASSERT( aDSL.isInDSL( aF ) ); </div>
<div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  ASSERT( aDSL.isInDSL( aL ) ); </div>
<div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  ASSERT( aDSL.beforeOrEqual(aF, aL) ); </div>
<div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  </div>
<div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  //specific case: DSS of one point</div>
<div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  if (aF == aL)</div>
<div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  {</div>
<div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  return DSS( aF ); </div>
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  }</div>
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  //otherwise</div>
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  else </div>
<div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  {</div>
<div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  //running smartCH to compute the minimal characteristics AND the leaning points</div>
<div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  OneItemOutputIterator<Point> lastUpperVertex, lastLowerVertex;</div>
<div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  using namespace functions; </div>
<div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  </div>
<div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  Vector v = smartCH( aDSL, aF, ( aDSL.position(aL) - aDSL.position(aF) ),</div>
<div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  lastUpperVertex, lastLowerVertex );</div>
<div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  </div>
<div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  //DSS construction</div>
<div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  Point U = lastUpperVertex.get(); </div>
<div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  DSL dsl( v[1], v[0], DSL::remainder(v[1], v[0], U) ); </div>
<div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  Point L = lastLowerVertex.get() + dsl.shift();</div>
<div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  //NB: U (resp. L) can be the first or the last upper (resp. lower) leaning point </div>
<div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  // of the DSS according to the relative order of their position.</div>
<div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  ASSERT( dsl.position(v) != 0 ); </div>
<div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  Position qUForward = ( dsl.position(aL) - dsl.position(U) ) / dsl.position(v); </div>
<div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  Position qLForward = ( dsl.position(aL) - dsl.position(L) ) / dsl.position(v); </div>
<div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  Position qUBackward = ( dsl.position(U) - dsl.position(aF) ) / dsl.position(v); </div>
<div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  Position qLBackward = ( dsl.position(L) - dsl.position(aF) ) / dsl.position(v); </div>
<div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  return DSS( v[1], v[0], dsl.mu(), DSL::remainder(v[1], v[0], L), aF, aL, </div>
<div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  (U - qUBackward * v), (U + qUForward * v ), </div>
<div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  (L - qLBackward * v), (L + qLForward * v ), </div>
<div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  dsl.steps(), dsl.shift() );</div>
<div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  }</div>
<div class="line"><a name="l00084"></a><span class="lineno"> 84</span> }</div>
<div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  </div>
<div class="line"><a name="l00086"></a><span class="lineno"> 86</span> //-----------------------------------------------------------------------------</div>
<div class="line"><a name="l00087"></a><span class="lineno"> 87</span> template <typename TCoordinate, typename TInteger, unsigned short adjacency></div>
<div class="line"><a name="l00088"></a><span class="lineno"> 88</span> inline</div>
<div class="line"><a name="l00089"></a><span class="lineno"> 89</span> DGtal::ArithmeticalDSS<TCoordinate,TInteger,adjacency></div>
<div class="line"><a name="l00090"></a><span class="lineno"> 90</span> DGtal::ArithmeticalDSSFactory<TCoordinate,TInteger,adjacency>::</div>
<div class="line"><a name="l00091"></a><span class="lineno"> 91</span> createSubsegment(const DSS& aDSS, const Point& aF, const Point& aL)</div>
<div class="line"><a name="l00092"></a><span class="lineno"> 92</span> {</div>
<div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  ASSERT( aDSS.dsl().isInDSL( aF ) ); </div>
<div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  ASSERT( aDSS.dsl().isInDSL( aL ) ); </div>
<div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  ASSERT( aDSS.dsl().beforeOrEqual(aF, aL) ); </div>
<div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  ASSERT( aDSS.dsl().beforeOrEqual(aDSS.back(), aL) ); </div>
<div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  ASSERT( aDSS.dsl().beforeOrEqual(aF, aDSS.front()) ); </div>
<div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  </div>
<div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  //specific case: DSS of one point</div>
<div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  if (aF == aL)</div>
<div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  {</div>
<div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  return DSS( aF ); </div>
<div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  }</div>
<div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  //otherwise</div>
<div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  else </div>
<div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  {</div>
<div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  DSS leftSubsegment = createLeftSubsegment(aDSS, aL);</div>
<div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  DSS tmp = leftSubsegment.negate();</div>
<div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  DSS subsegment = createLeftSubsegment(tmp, aF); </div>
<div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  return subsegment.negate(); </div>
<div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  }</div>
<div class="line"><a name="l00112"></a><span class="lineno"> 112</span> }</div>
<div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  </div>
<div class="line"><a name="l00114"></a><span class="lineno"> 114</span> //-----------------------------------------------------------------------------</div>
<div class="line"><a name="l00115"></a><span class="lineno"> 115</span> template <typename TCoordinate, typename TInteger, unsigned short adjacency></div>
<div class="line"><a name="l00116"></a><span class="lineno"> 116</span> inline</div>
<div class="line"><a name="l00117"></a><span class="lineno"> 117</span> DGtal::ArithmeticalDSS<TCoordinate,TInteger,adjacency></div>
<div class="line"><a name="l00118"></a><span class="lineno"> 118</span> DGtal::ArithmeticalDSSFactory<TCoordinate,TInteger,adjacency>::</div>
<div class="line"><a name="l00119"></a><span class="lineno"> 119</span> createLeftSubsegment(const DSS& aDSS, const Point& aL)</div>
<div class="line"><a name="l00120"></a><span class="lineno"> 120</span> {</div>
<div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  //running reversedSmartCH to compute the minimal characteristics AND the leaning points</div>
<div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  OneItemOutputIterator<Point> lastUpperVertex, lastLowerVertex;</div>
<div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  using namespace functions; </div>
<div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  Vector v = reversedSmartCH( aDSS, aDSS.position(aL),</div>
<div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  lastUpperVertex, lastLowerVertex );</div>
<div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  </div>
<div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  //DSS construction</div>
<div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  Point U = lastUpperVertex.get(); </div>
<div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  DSL dsl( v[1], v[0], DSL::remainder(v[1], v[0], U) ); </div>
<div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  Point L = lastLowerVertex.get() + dsl.shift();</div>
<div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  //NB: U (resp. L) can be the first or the last upper (resp. lower) leaning point </div>
<div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  // of the DSS according to the relative order of their position. </div>
<div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  ASSERT( dsl.position(v) != 0 ); </div>
<div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  Position qUForward = ( dsl.position(aL) - dsl.position(U) ) / dsl.position(v); </div>
<div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  Position qLForward = ( dsl.position(aL) - dsl.position(L) ) / dsl.position(v); </div>
<div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  Position qUBackward = ( dsl.position(U) - dsl.position(aDSS.back()) ) / dsl.position(v); </div>
<div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  Position qLBackward = ( dsl.position(L) - dsl.position(aDSS.back()) ) / dsl.position(v); </div>
<div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  return DSS( v[1], v[0], dsl.mu(), DSL::remainder(v[1], v[0], L), aDSS.back(), aL, </div>
<div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  (U - qUBackward * v), (U + qUForward * v ), </div>
<div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  (L - qLBackward * v), (L + qLForward * v ), </div>
<div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  dsl.steps(), dsl.shift() );</div>
<div class="line"><a name="l00142"></a><span class="lineno"> 142</span> }</div>
<div class="line"><a name="l00143"></a><span class="lineno"> 143</span> //-----------------------------------------------------------------------------</div>
<div class="line"><a name="l00144"></a><span class="lineno"> 144</span> template <typename TCoordinate, typename TInteger, unsigned short adjacency></div>
<div class="line"><a name="l00145"></a><span class="lineno"> 145</span> inline</div>
<div class="line"><a name="l00146"></a><span class="lineno"> 146</span> DGtal::ArithmeticalDSS<TCoordinate,TInteger,adjacency></div>
<div class="line"><a name="l00147"></a><span class="lineno"> 147</span> DGtal::ArithmeticalDSSFactory<TCoordinate,TInteger,adjacency>::createPattern(const Point& aF, const Point& aL)</div>
<div class="line"><a name="l00148"></a><span class="lineno"> 148</span> {</div>
<div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  </div>
<div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  //specific case: a and b are both null</div>
<div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  if (aF == aL)</div>
<div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  {</div>
<div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  return DSS( aF ); </div>
<div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  }</div>
<div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  //otherwise</div>
<div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  else </div>
<div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  {</div>
<div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  </div>
<div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  //upper leaning points </div>
<div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  Point Uf, Ul, Lf, Ll; </div>
<div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  Uf = aF; </div>
<div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  Ul = aL; </div>
<div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  </div>
<div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  //direction vector</div>
<div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  Vector u2 = aL - aF; </div>
<div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  IntegerComputer<Coordinate> computer; </div>
<div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  Coordinate gcd = computer.gcd(u2[0], u2[1]); </div>
<div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  </div>
<div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  //irreductible direction vector</div>
<div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  Vector u = Vector(u2[0]/gcd, u2[1]/gcd);</div>
<div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  </div>
<div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  //intercept</div>
<div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  Integer mu = DSL::remainder(u[1], u[0], Uf); </div>
<div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  </div>
<div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  //DSL</div>
<div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  DSL dsl(u[1], u[0], mu); </div>
<div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  </div>
<div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  //lower leaning points</div>
<div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  if ( dsl.steps().second == Vector(NumberTraits<TCoordinate>::ZERO,NumberTraits<TCoordinate>::ZERO) )</div>
<div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  { //specific case: there is only one step, </div>
<div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  //ie. either a == 0, or b == 0, or </div>
<div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  //(a == 1 and b == 1) in the naive case</div>
<div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  Lf = Uf; </div>
<div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  Ll = Ul; </div>
<div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  </div>
<div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  return DSS(dsl.a(), dsl.b(), </div>
<div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  mu, mu, aF, aL, </div>
<div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  Uf, Ul, Lf, Ll, </div>
<div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  dsl.steps(), dsl.shift());</div>
<div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  }</div>
<div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  else </div>
<div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  { //otherwise</div>
<div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  Coordinate signedUnity = -1; </div>
<div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  Vector v = bezoutVector(u[1], u[0], signedUnity);</div>
<div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  Lf = Uf + v - dsl.shift()*signedUnity; </div>
<div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  Ll = Uf + u*(gcd-1) + v - dsl.shift()*signedUnity; </div>
<div class="line"><a name="l00197"></a><span class="lineno"> 197</span>  </div>
<div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  return DSS(dsl.a(), dsl.b(), </div>
<div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  mu, DSL::remainder(u[1], u[0], Lf), </div>
<div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  aF, aL, </div>
<div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  Uf, Ul, Lf, Ll, </div>
<div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  dsl.steps(), dsl.shift());</div>
<div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  }</div>
<div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  }</div>
<div class="line"><a name="l00205"></a><span class="lineno"> 205</span> }</div>
<div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  </div>
<div class="line"><a name="l00207"></a><span class="lineno"> 207</span> //-----------------------------------------------------------------------------</div>
<div class="line"><a name="l00208"></a><span class="lineno"> 208</span> template <typename TCoordinate, typename TInteger, unsigned short adjacency></div>
<div class="line"><a name="l00209"></a><span class="lineno"> 209</span> inline</div>
<div class="line"><a name="l00210"></a><span class="lineno"> 210</span> DGtal::ArithmeticalDSS<TCoordinate,TInteger,adjacency></div>
<div class="line"><a name="l00211"></a><span class="lineno"> 211</span> DGtal::ArithmeticalDSSFactory<TCoordinate,TInteger,adjacency>::createDSS(const Coordinate& aA, const Coordinate& aB, const Point& aFirst, const Point& aLast, const Point& aU)</div>
<div class="line"><a name="l00212"></a><span class="lineno"> 212</span> {</div>
<div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  Point Uf, Ul, Lf, Ll;</div>
<div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  DSL dsl(aA,aB,DSL::remainder(aA,aB,aU));</div>
<div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  </div>
<div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  Vector u(aB,aA);</div>
<div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  </div>
<div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  </div>
<div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  //Upper leaning points</div>
<div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  </div>
<div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  Vector t = (aLast-aU)/u;</div>
<div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  Integer k1 = (t[0]>t[1])?t[1]:t[0];</div>
<div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  </div>
<div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  Ul = aU + u*k1;</div>
<div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  </div>
<div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  t = (aU-aFirst)/u;</div>
<div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  Integer k2 = (t[0]>t[1])?t[1]:t[0];</div>
<div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  Uf = aU - u*k2;</div>
<div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  </div>
<div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  </div>
<div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  //Lower leaning points</div>
<div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  if ( dsl.steps().second == Vector(NumberTraits<TCoordinate>::ZERO,NumberTraits<TCoordinate>::ZERO) )</div>
<div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  { //specific case: there is only one step, </div>
<div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  //ie. either a == 0, or b == 0, or </div>
<div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  //(a == 1 and b == 1) in the naive case</div>
<div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  Lf = Uf; </div>
<div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  Ll = Ul; </div>
<div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  }</div>
<div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  else </div>
<div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  { //otherwise</div>
<div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  Coordinate signedUnity = -1; </div>
<div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  Vector v = bezoutVector(aA, aB, signedUnity);</div>
<div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  v += dsl.shift(); // "forward" vector from an upper to a lower leaning point</div>
<div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  Vector w = v - u; // "backward" vector from an upper to a lower leaning point</div>
<div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  if(dsl.beforeOrEqual(aFirst,Uf+w)) // there is a lower leaning point before Uf</div>
<div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  Lf = Uf + w;</div>
<div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  else</div>
<div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  Lf = Uf + v;</div>
<div class="line"><a name="l00249"></a><span class="lineno"> 249</span>  </div>
<div class="line"><a name="l00250"></a><span class="lineno"> 250</span>  if(dsl.beforeOrEqual(Ul+v,aLast))</div>
<div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  Ll = Ul + v;</div>
<div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  else</div>
<div class="line"><a name="l00253"></a><span class="lineno"> 253</span>  Ll = Ul + w;</div>
<div class="line"><a name="l00254"></a><span class="lineno"> 254</span>  }</div>
<div class="line"><a name="l00255"></a><span class="lineno"> 255</span>  </div>
<div class="line"><a name="l00256"></a><span class="lineno"> 256</span>  DSS res(dsl.a(), dsl.b(), aFirst, aLast, Uf, Ul, Lf, Ll);</div>
<div class="line"><a name="l00257"></a><span class="lineno"> 257</span>  </div>
<div class="line"><a name="l00258"></a><span class="lineno"> 258</span>  assert(res.isValid());</div>
<div class="line"><a name="l00259"></a><span class="lineno"> 259</span>  </div>
<div class="line"><a name="l00260"></a><span class="lineno"> 260</span>  return res;</div>
<div class="line"><a name="l00261"></a><span class="lineno"> 261</span>  </div>
<div class="line"><a name="l00262"></a><span class="lineno"> 262</span> }</div>
<div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  </div>
<div class="line"><a name="l00264"></a><span class="lineno"> 264</span>  </div>
<div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  </div>
<div class="line"><a name="l00266"></a><span class="lineno"> 266</span> //-----------------------------------------------------------------------------</div>
<div class="line"><a name="l00267"></a><span class="lineno"> 267</span> template <typename TCoordinate, typename TInteger, unsigned short adjacency></div>
<div class="line"><a name="l00268"></a><span class="lineno"> 268</span> inline</div>
<div class="line"><a name="l00269"></a><span class="lineno"> 269</span> DGtal::ArithmeticalDSS<TCoordinate,TInteger,adjacency></div>
<div class="line"><a name="l00270"></a><span class="lineno"> 270</span> DGtal::ArithmeticalDSSFactory<TCoordinate,TInteger,adjacency>::createReversedPattern(const Point& aF, const Point& aL)</div>
<div class="line"><a name="l00271"></a><span class="lineno"> 271</span> {</div>
<div class="line"><a name="l00272"></a><span class="lineno"> 272</span>  DGtal::ArithmeticalDSS<TCoordinate,TInteger,adjacency> pattern = createPattern(aL, aF); </div>
<div class="line"><a name="l00273"></a><span class="lineno"> 273</span>  return pattern.negate(); </div>
<div class="line"><a name="l00274"></a><span class="lineno"> 274</span> }</div>
<div class="line"><a name="l00275"></a><span class="lineno"> 275</span>  </div>
<div class="line"><a name="l00276"></a><span class="lineno"> 276</span> //-----------------------------------------------------------------------------</div>
<div class="line"><a name="l00277"></a><span class="lineno"> 277</span> template <typename TCoordinate, typename TInteger, unsigned short adjacency></div>
<div class="line"><a name="l00278"></a><span class="lineno"> 278</span> inline</div>
<div class="line"><a name="l00279"></a><span class="lineno"> 279</span> typename DGtal::ArithmeticalDSSFactory<TCoordinate,TInteger,adjacency>::Vector</div>
<div class="line"><a name="l00280"></a><span class="lineno"> 280</span> DGtal::ArithmeticalDSSFactory<TCoordinate,TInteger,adjacency>::</div>
<div class="line"><a name="l00281"></a><span class="lineno"> 281</span> bezoutVector(const Coordinate& aA, </div>
<div class="line"><a name="l00282"></a><span class="lineno"> 282</span>  const Coordinate& aB, </div>
<div class="line"><a name="l00283"></a><span class="lineno"> 283</span>  const Coordinate& aR)</div>
<div class="line"><a name="l00284"></a><span class="lineno"> 284</span> {</div>
<div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  ASSERT( (aR == 1)||(aR == -1) ); </div>
<div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  </div>
<div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  //compute one Bezout vector</div>
<div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  IntegerComputer<Coordinate> computer; </div>
<div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  Vector v = computer.extendedEuclid(aA, -aB, aR); </div>
<div class="line"><a name="l00290"></a><span class="lineno"> 290</span>  ASSERT( (aA*v[0]-aB*v[1]) == aR );</div>
<div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  </div>
<div class="line"><a name="l00292"></a><span class="lineno"> 292</span>  // compute the one whose component</div>
<div class="line"><a name="l00293"></a><span class="lineno"> 293</span>  // have a sign equal to the direction</div>
<div class="line"><a name="l00294"></a><span class="lineno"> 294</span>  // vector components</div>
<div class="line"><a name="l00295"></a><span class="lineno"> 295</span>  // modify v if and only if aB and v[0] or aA and v[1] have strictly different signs</div>
<div class="line"><a name="l00296"></a><span class="lineno"> 296</span>  </div>
<div class="line"><a name="l00297"></a><span class="lineno"> 297</span>  if ( (aB > 0)&&(v[0] < 0) )</div>
<div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  v += Vector(aB,aA); </div>
<div class="line"><a name="l00299"></a><span class="lineno"> 299</span>  else if ( (aB < 0)&&(v[0] > 0) )</div>
<div class="line"><a name="l00300"></a><span class="lineno"> 300</span>  v += Vector(aB,aA); </div>
<div class="line"><a name="l00301"></a><span class="lineno"> 301</span>  else if ( ( aA > 0 )&&(v[1] < 0) )</div>
<div class="line"><a name="l00302"></a><span class="lineno"> 302</span>  v += Vector(aB,aA);</div>
<div class="line"><a name="l00303"></a><span class="lineno"> 303</span>  else if ( ( aA < 0 )&&(v[1] > 0) )</div>
<div class="line"><a name="l00304"></a><span class="lineno"> 304</span>  v += Vector(aB,aA);</div>
<div class="line"><a name="l00305"></a><span class="lineno"> 305</span>  </div>
<div class="line"><a name="l00306"></a><span class="lineno"> 306</span>  ASSERT( (aA*v[0]-aB*v[1]) == aR );</div>
<div class="line"><a name="l00307"></a><span class="lineno"> 307</span>  </div>
<div class="line"><a name="l00308"></a><span class="lineno"> 308</span>  // Assert that for the pairs (aA,v[1]) and (aB,v[0]) either one member is null, or they have the same sign</div>
<div class="line"><a name="l00309"></a><span class="lineno"> 309</span>  ASSERT( (aA ==0 || v[1] == 0 || (aA > 0 && v[1] > 0) || (aA < 0 && v[1] <0)) && (aB ==0 || v[0] == 0 || (aB > 0 && v[0] > 0) || (aB < 0 && v[0] <0)));</div>
<div class="line"><a name="l00310"></a><span class="lineno"> 310</span>  </div>
<div class="line"><a name="l00311"></a><span class="lineno"> 311</span>  return v; </div>
<div class="line"><a name="l00312"></a><span class="lineno"> 312</span> }</div>
<div class="line"><a name="l00313"></a><span class="lineno"> 313</span>  </div>
<div class="line"><a name="l00314"></a><span class="lineno"> 314</span>  </div>
<div class="line"><a name="l00315"></a><span class="lineno"> 315</span>  </div>
</div><!-- fragment --></div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="dir_68267d1309a1af8e8297ef4c3efbcdba.html">src</a></li><li class="navelem"><a class="el" href="dir_f2cd1aeea1cfa982bb13a5f95fa4218c.html">DGtal</a></li><li class="navelem"><a class="el" href="dir_754267a81a1dbd2dcdc6a3e6905a7e31.html">geometry</a></li><li class="navelem"><a class="el" href="dir_f470c2f5fde179648eef8a3806cdaeb7.html">curves</a></li><li class="navelem"><b>ArithmeticalDSSFactory.ih</b></li>
<li class="footer">Generated on Mon Dec 23 2024 13:18:27 for DGtal by <a href="https://www.doxygen.org/index.html"><img class="footer" src="doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.9.1 </li>
</ul>
</div>
</body>
</html>