-
Notifications
You must be signed in to change notification settings - Fork 0
/
2dSimplePolygonDigitizer_8cpp_source.html
378 lines (376 loc) · 50 KB
/
2dSimplePolygonDigitizer_8cpp_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
<!-- HTML header for doxygen 1.8.11-->
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://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"/>
<title>DGtalTools: 2dSimplePolygonDigitizer.cpp 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="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="modern-doxygen-green.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">DGtalTools
 <span id="projectnumber">1.5.beta</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>
<!-- 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 id="nav-path" class="navpath">
<ul>
<li class="navelem"><a class="el" href="dir_76ab5dc027795deb5b098ae38ba247cb.html">generators</a></li> </ul>
</div>
</div><!-- top -->
<div class="header">
<div class="headertitle">
<div class="title">2dSimplePolygonDigitizer.cpp</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="l00030"></a><span class="lineno"> 30</span> <span class="preprocessor">#include <iostream></span></div>
<div class="line"><a name="l00031"></a><span class="lineno"> 31</span> <span class="preprocessor">#include <vector></span></div>
<div class="line"><a name="l00032"></a><span class="lineno"> 32</span> <span class="preprocessor">#include <string></span></div>
<div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="preprocessor">#include <iterator></span></div>
<div class="line"><a name="l00034"></a><span class="lineno"> 34</span> <span class="preprocessor">#include <fstream></span></div>
<div class="line"><a name="l00035"></a><span class="lineno"> 35</span>  </div>
<div class="line"><a name="l00036"></a><span class="lineno"> 36</span> <span class="preprocessor">#include "CLI11.hpp"</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> <span class="preprocessor">#include "DGtal/base/Common.h"</span></div>
<div class="line"><a name="l00039"></a><span class="lineno"> 39</span> <span class="preprocessor">#include "DGtal/helpers/StdDefs.h"</span></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> <span class="comment">//image</span></div>
<div class="line"><a name="l00042"></a><span class="lineno"> 42</span> <span class="preprocessor">#include "DGtal/io/writers/GenericWriter.h"</span></div>
<div class="line"><a name="l00043"></a><span class="lineno"> 43</span> <span class="preprocessor">#include "DGtal/images/ImageSelector.h"</span></div>
<div class="line"><a name="l00044"></a><span class="lineno"> 44</span> <span class="preprocessor">#include "DGtal/io/boards/Board2D.h"</span></div>
<div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  </div>
<div class="line"><a name="l00046"></a><span class="lineno"> 46</span> <span class="comment">//contour</span></div>
<div class="line"><a name="l00047"></a><span class="lineno"> 47</span> <span class="preprocessor">#include "DGtal/io/readers/PointListReader.h"</span></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> <span class="keyword">using namespace </span><a class="code" href="namespaceDGtal.html">DGtal</a>;</div>
<div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  </div>
<div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  </div>
<div class="line"><a name="l00101"></a><span class="lineno"> 101</span> std::pair<Z2i::Point, Z2i::Point > getBoundingBox(<span class="keyword">const</span> std::vector<Z2i::Point>& vecPts);</div>
<div class="line"><a name="l00102"></a><span class="lineno"> 102</span> std::vector<Z2i::Point> GaussDigization(<span class="keyword">const</span> std::vector<Z2i::Point>& polygon);</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> <span class="keywordtype">int</span> <a class="code" href="3dHeightMapViewer_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627">main</a>( <span class="keywordtype">int</span> argc, <span class="keywordtype">char</span>** argv )</div>
<div class="line"><a name="l00105"></a><span class="lineno"> 105</span> {</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>  <span class="comment">// parse command line using CLI ----------------------------------------------</span></div>
<div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  CLI::App app;</div>
<div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  std::string inputFileName;</div>
<div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  std::string outputFileName=<span class="stringliteral">"result.pgm"</span>;</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>  app.description(<span class="stringliteral">"compute the set of integer points inside the input polyline.\n Basic example:\n \t 2dSimplePolygonDigitizer -i inputPolyline.sdp -o contourDisplay.pgm"</span>);</div>
<div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  app.add_option(<span class="stringliteral">"-i,--input,1"</span>, inputFileName, <span class="stringliteral">"Input filename (freeman chain of sdp)."</span> )</div>
<div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  ->required()</div>
<div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  ->check(CLI::ExistingFile);</div>
<div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  app.add_option(<span class="stringliteral">"-o,--output,2"</span>, outputFileName, <span class="stringliteral">"Output filename"</span>, <span class="keyword">true</span>);</div>
<div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  </div>
<div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  app.get_formatter()->column_width(40);</div>
<div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  CLI11_PARSE(app, argc, argv);</div>
<div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  <span class="comment">// END parse command line using CLI ----------------------------------------------</span></div>
<div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  </div>
<div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  std::string inputExt = inputFileName.substr(inputFileName.find_last_of(<span class="stringliteral">"."</span>)+1);</div>
<div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  <span class="keywordflow">if</span>(inputExt != <span class="stringliteral">"sdp"</span>){</div>
<div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  <a class="codeRef" href="https://dgtal-team.github.io/doc-nightly/namespaceDGtal.html#a604c07ec391ad12a1f3fb6479993f112">trace</a>.<a class="codeRef" href="https://dgtal-team.github.io/doc-nightly/classDGtal_1_1Trace.html#a1e786a1f3b1047e92b73c82f67e3c295">error</a>() << <span class="stringliteral">"input file should be sdp file"</span> << std::endl;</div>
<div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  <span class="keywordflow">return</span> EXIT_FAILURE;</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>  </div>
<div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  std::vector<Z2i::Point> poly = <a class="codeRef" href="https://dgtal-team.github.io/doc-nightly/structDGtal_1_1PointListReader.html#a7aa38c2b50493b7437533d410ffed20a">PointListReader<Z2i::Point>::getPointsFromFile</a>(inputFileName);</div>
<div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  std::vector<Z2i::Point> gd = GaussDigization(poly);</div>
<div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  </div>
<div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  std::string outputExt = outputFileName.substr(outputFileName.find_last_of(<span class="stringliteral">"."</span>)+1);</div>
<div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  std::string outputBaseName = outputFileName.substr(0, outputFileName.find_last_of(<span class="stringliteral">"."</span>));</div>
<div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  </div>
<div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  <span class="keywordflow">if</span>(outputExt == <span class="stringliteral">"pgm"</span>) {</div>
<div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  <span class="comment">//Write results to pgm image</span></div>
<div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  std::pair<Z2i::Point, Z2i::Point> bb = getBoundingBox(gd);</div>
<div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  <span class="keyword">typedef</span> <a class="codeRef" href="https://dgtal-team.github.io/doc-nightly/classDGtal_1_1ImageContainerBySTLVector.html">ImageSelector <Z2i::Domain, unsigned char>::Type</a> <a class="codeRef" href="https://dgtal-team.github.io/doc-nightly/classDGtal_1_1Image.html">Image</a>;</div>
<div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  <a class="codeRef" href="https://dgtal-team.github.io/doc-nightly/classDGtal_1_1PointVector.html">Z2i::Point</a> p1 = bb.first-<a class="codeRef" href="https://dgtal-team.github.io/doc-nightly/namespaceDGtal_1_1Z2i.html#ac0a04516c81db6f4a583eddda0f64875">Z2i::Point</a>(1,1);</div>
<div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  <a class="codeRef" href="https://dgtal-team.github.io/doc-nightly/classDGtal_1_1PointVector.html">Z2i::Point</a> p2 = bb.second+<a class="codeRef" href="https://dgtal-team.github.io/doc-nightly/namespaceDGtal_1_1Z2i.html#ac0a04516c81db6f4a583eddda0f64875">Z2i::Point</a>(1,1);</div>
<div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  <a class="codeRef" href="https://dgtal-team.github.io/doc-nightly/classDGtal_1_1Image.html">Image</a> image(<a class="codeRef" href="https://dgtal-team.github.io/doc-nightly/classDGtal_1_1HyperRectDomain.html">Z2i::Domain</a>(p1,p2));</div>
<div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  <span class="keywordflow">for</span>(std::vector<Z2i::Point>::const_iterator it=gd.begin(); it!=gd.end(); it++) {</div>
<div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  <a class="codeRef" href="https://dgtal-team.github.io/doc-nightly/classDGtal_1_1PointVector.html">Z2i::Point</a> p ((*it)[0],(*it)[1]);</div>
<div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  image.setValue(p,255);</div>
<div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  }</div>
<div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  <a class="codeRef" href="https://dgtal-team.github.io/doc-nightly/structDGtal_1_1PGMWriter.html#aea1f9f2729f8da56df859a813bf5250b">PGMWriter<Image>::exportPGM</a>(outputFileName,image);</div>
<div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  }</div>
<div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  <span class="keywordflow">else</span> {</div>
<div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  <span class="comment">//Write results to svg image</span></div>
<div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  outputFileName = outputBaseName + <span class="stringliteral">".svg"</span>;</div>
<div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  <a class="codeRef" href="https://dgtal-team.github.io/doc-nightly/classDGtal_1_1Board2D.html">DGtal::Board2D</a> board;</div>
<div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  board << <a class="codeRef" href="https://dgtal-team.github.io/doc-nightly/structDGtal_1_1SetMode.html">DGtal::SetMode</a>(<span class="stringliteral">"PointVector"</span>, <span class="stringliteral">"Both"</span>);</div>
<div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  <span class="keywordflow">for</span>(std::vector<Z2i::Point>::const_iterator it=gd.begin(); it!=gd.end(); it++) {</div>
<div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  board << *it;</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>  board.<a class="codeRef" href="https://dgtal-team.github.io/doc-nightly/classLibBoard_1_1Board.html#a0c38953e04956d357afa05c9734178f2">setPenColor</a>(<a class="codeRef" href="https://dgtal-team.github.io/doc-nightly/classDGtal_1_1Color.html#aa5e8679bd0da49f95d13cd95a17b619b">DGtal::Color::Red</a>);</div>
<div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  board.<a class="codeRef" href="https://dgtal-team.github.io/doc-nightly/classLibBoard_1_1Board.html#ac188d9b5f030366abc53d6fd46b14c3b">setLineWidth</a>(2);</div>
<div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  <span class="keywordflow">for</span>(<span class="keywordtype">size_t</span> it=0; it<poly.size()-1; it++) {</div>
<div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  <a class="codeRef" href="https://dgtal-team.github.io/doc-nightly/classDGtal_1_1PointVector.html">DGtal::Z2i::RealPoint</a> p1 (poly.at(it)[0],poly.at(it)[1]);</div>
<div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  <a class="codeRef" href="https://dgtal-team.github.io/doc-nightly/classDGtal_1_1PointVector.html">DGtal::Z2i::RealPoint</a> p2 (poly.at(it+1)[0],poly.at(it+1)[1]);</div>
<div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  board.<a class="codeRef" href="https://dgtal-team.github.io/doc-nightly/classLibBoard_1_1Board.html#a64cfaa0d8e99ffe65b99c7be040fbbc5">drawLine</a>(p1[0],p1[1],p2[0],p2[1]);</div>
<div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  }</div>
<div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  <a class="codeRef" href="https://dgtal-team.github.io/doc-nightly/classDGtal_1_1PointVector.html">DGtal::Z2i::RealPoint</a> p1 (poly.front()[0],poly.front()[1]);</div>
<div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  <a class="codeRef" href="https://dgtal-team.github.io/doc-nightly/classDGtal_1_1PointVector.html">DGtal::Z2i::RealPoint</a> p2 (poly.back()[0],poly.back()[1]);</div>
<div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  board.<a class="codeRef" href="https://dgtal-team.github.io/doc-nightly/classLibBoard_1_1Board.html#a64cfaa0d8e99ffe65b99c7be040fbbc5">drawLine</a>(p1[0],p1[1],p2[0],p2[1]);</div>
<div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  </div>
<div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  board.<a class="codeRef" href="https://dgtal-team.github.io/doc-nightly/classLibBoard_1_1Board.html#adab1403965fea54c0de9bfe38e1e6724">saveSVG</a>(outputFileName.c_str());</div>
<div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  }</div>
<div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  <span class="keywordflow">return</span> EXIT_SUCCESS;</div>
<div class="line"><a name="l00169"></a><span class="lineno"> 169</span> }</div>
<div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  </div>
<div class="line"><a name="l00171"></a><span class="lineno"> 171</span> <span class="comment">// Auxiliaires functions</span></div>
<div class="line"><a name="l00172"></a><span class="lineno"> 172</span> <span class="comment">// Compute the bounding box of the polyline</span></div>
<div class="line"><a name="l00173"></a><span class="lineno"> 173</span> std::pair<Z2i::Point, Z2i::Point > getBoundingBox(<span class="keyword">const</span> std::vector<Z2i::Point>& vecPts) {</div>
<div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  <span class="keywordtype">int</span> minX = vecPts.at(0)[0];</div>
<div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  <span class="keywordtype">int</span> maxX = vecPts.at(0)[0];</div>
<div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  <span class="keywordtype">int</span> minY = vecPts.at(0)[1];</div>
<div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  <span class="keywordtype">int</span> maxY = vecPts.at(0)[1];</div>
<div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  </div>
<div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  <span class="keywordflow">for</span>(<span class="keywordtype">size_t</span> it=1; it<vecPts.size(); it++) {</div>
<div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  <span class="keywordtype">int</span> x = vecPts.at(it)[0];</div>
<div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  <span class="keywordtype">int</span> y = vecPts.at(it)[1];</div>
<div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  <span class="keywordflow">if</span>(minX > x) minX = x;</div>
<div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  <span class="keywordflow">if</span>(maxX < x) maxX = x;</div>
<div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  <span class="keywordflow">if</span>(minY > y) minY = y;</div>
<div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  <span class="keywordflow">if</span>(maxY < y) maxY = y;</div>
<div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  }</div>
<div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  <a class="codeRef" href="https://dgtal-team.github.io/doc-nightly/classDGtal_1_1PointVector.html">Z2i::Point</a> tl (minX,minY);</div>
<div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  <a class="codeRef" href="https://dgtal-team.github.io/doc-nightly/classDGtal_1_1PointVector.html">Z2i::Point</a> rb (maxX,maxY);</div>
<div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  <span class="keywordflow">return</span> std::make_pair(tl,rb);</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>  </div>
<div class="line"><a name="l00192"></a><span class="lineno"> 192</span> <span class="comment">/* Source adapted from : https://www.geeksforgeeks.org/how-to-check-if-a-given-point-lies-inside-a-polygon/ */</span></div>
<div class="line"><a name="l00193"></a><span class="lineno"> 193</span> <span class="comment">// Given three colinear points p, q, r, the function checks if</span></div>
<div class="line"><a name="l00194"></a><span class="lineno"> 194</span> <span class="comment">// point q lies on line segment 'pr'</span></div>
<div class="line"><a name="l00195"></a><span class="lineno"> 195</span> <span class="keyword">template</span><<span class="keyword">typename</span> T></div>
<div class="line"><a name="l00196"></a><span class="lineno"> 196</span> T max(T v1, T v2) {</div>
<div class="line"><a name="l00197"></a><span class="lineno"> 197</span>  <span class="keywordflow">return</span> v1 > v2 ? v1 : v2;</div>
<div class="line"><a name="l00198"></a><span class="lineno"> 198</span> }</div>
<div class="line"><a name="l00199"></a><span class="lineno"> 199</span> <span class="keyword">template</span><<span class="keyword">typename</span> T></div>
<div class="line"><a name="l00200"></a><span class="lineno"> 200</span> T min(T v1, T v2) {</div>
<div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  <span class="keywordflow">return</span> v1 > v2 ? v2 : v1;</div>
<div class="line"><a name="l00202"></a><span class="lineno"> 202</span> }</div>
<div class="line"><a name="l00203"></a><span class="lineno"> 203</span> <span class="keyword">template</span><<span class="keyword">typename</span> TPo<span class="keywordtype">int</span>></div>
<div class="line"><a name="l00204"></a><span class="lineno"> 204</span> <span class="keywordtype">bool</span> onSegment(TPoint p, TPoint q, TPoint r)</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>  <span class="keywordflow">if</span> (q[0] <= max(p[0], r[0]) && q[0] >= min(p[0], r[0]) && q[1] <= max(p[1], r[1]) && q[1] >= min(p[1], r[1]))</div>
<div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l00209"></a><span class="lineno"> 209</span> }</div>
<div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  </div>
<div class="line"><a name="l00211"></a><span class="lineno"> 211</span> <span class="comment">// To find orientation of ordered triplet (p, q, r).</span></div>
<div class="line"><a name="l00212"></a><span class="lineno"> 212</span> <span class="comment">// The function returns following values</span></div>
<div class="line"><a name="l00213"></a><span class="lineno"> 213</span> <span class="comment">// 0 --> p, q and r are colinear</span></div>
<div class="line"><a name="l00214"></a><span class="lineno"> 214</span> <span class="comment">// 1 --> Clockwise</span></div>
<div class="line"><a name="l00215"></a><span class="lineno"> 215</span> <span class="comment">// 2 --> Counterclockwise</span></div>
<div class="line"><a name="l00216"></a><span class="lineno"> 216</span> <span class="keyword">template</span><<span class="keyword">typename</span> TPo<span class="keywordtype">int</span>></div>
<div class="line"><a name="l00217"></a><span class="lineno"> 217</span> <span class="keywordtype">int</span> orientation(TPoint p, TPoint q, TPoint r)</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>  <span class="keywordtype">int</span> val = (q[1] - p[1]) * (r[0] - q[0]) - (q[0] - p[0]) * (r[1] - q[1]);</div>
<div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  <span class="keywordflow">if</span> (val == 0) <span class="keywordflow">return</span> 0; <span class="comment">// colinear</span></div>
<div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  <span class="keywordflow">return</span> (val > 0)? 1: 2; <span class="comment">// clock or counterclock wise</span></div>
<div class="line"><a name="l00222"></a><span class="lineno"> 222</span> }</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> <span class="comment">// The function that returns true if line segment 'p1q1'</span></div>
<div class="line"><a name="l00225"></a><span class="lineno"> 225</span> <span class="comment">// and 'p2q2' intersect.</span></div>
<div class="line"><a name="l00226"></a><span class="lineno"> 226</span> <span class="keyword">template</span><<span class="keyword">typename</span> TPo<span class="keywordtype">int</span>></div>
<div class="line"><a name="l00227"></a><span class="lineno"> 227</span> <span class="keywordtype">bool</span> doIntersect(TPoint p1, TPoint q1, TPoint p2, TPoint q2)</div>
<div class="line"><a name="l00228"></a><span class="lineno"> 228</span> {</div>
<div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  <span class="comment">// Find the four orientations needed for general and</span></div>
<div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  <span class="comment">// special cases</span></div>
<div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  <span class="keywordtype">int</span> o1 = orientation(p1, q1, p2);</div>
<div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  <span class="keywordtype">int</span> o2 = orientation(p1, q1, q2);</div>
<div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  <span class="keywordtype">int</span> o3 = orientation(p2, q2, p1);</div>
<div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  <span class="keywordtype">int</span> o4 = orientation(p2, q2, q1);</div>
<div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  </div>
<div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  <span class="comment">// General case</span></div>
<div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  <span class="keywordflow">if</span> (o1 != o2 && o3 != o4)</div>
<div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  </div>
<div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  <span class="comment">// Special Cases</span></div>
<div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  <span class="comment">// p1, q1 and p2 are colinear and p2 lies on segment p1q1</span></div>
<div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  <span class="keywordflow">if</span> (o1 == 0 && onSegment(p1, p2, q1)) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  </div>
<div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  <span class="comment">// p1, q1 and p2 are colinear and q2 lies on segment p1q1</span></div>
<div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  <span class="keywordflow">if</span> (o2 == 0 && onSegment(p1, q2, q1)) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  </div>
<div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  <span class="comment">// p2, q2 and p1 are colinear and p1 lies on segment p2q2</span></div>
<div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  <span class="keywordflow">if</span> (o3 == 0 && onSegment(p2, p1, q2)) <span class="keywordflow">return</span> <span class="keyword">true</span>;</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>  <span class="comment">// p2, q2 and q1 are colinear and q1 lies on segment p2q2</span></div>
<div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  <span class="keywordflow">if</span> (o4 == 0 && onSegment(p2, q1, q2)) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  </div>
<div class="line"><a name="l00253"></a><span class="lineno"> 253</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>; <span class="comment">// Doesn't fall in any of the above cases</span></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> <span class="comment">//Find direction that does not pass through any vertex of the polygon</span></div>
<div class="line"><a name="l00257"></a><span class="lineno"> 257</span> <span class="keyword">template</span><<span class="keyword">typename</span> TPo<span class="keywordtype">int</span>></div>
<div class="line"><a name="l00258"></a><span class="lineno"> 258</span> TPoint findDirection(<span class="keyword">const</span> std::vector<TPoint>& polygon, TPoint p, TPoint d1, TPoint d2 )</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>  TPoint d = d1;</div>
<div class="line"><a name="l00261"></a><span class="lineno"> 261</span>  <span class="keywordtype">bool</span> belong = <span class="keyword">true</span>;</div>
<div class="line"><a name="l00262"></a><span class="lineno"> 262</span>  <span class="comment">//Find the ray that doest pass by any vertices of polygon</span></div>
<div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  <span class="keywordflow">do</span> {</div>
<div class="line"><a name="l00264"></a><span class="lineno"> 264</span>  belong = <span class="keyword">false</span>;</div>
<div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  <span class="keywordflow">for</span>(<span class="keywordtype">size_t</span> it=0; it<polygon.size(); it++) {</div>
<div class="line"><a name="l00266"></a><span class="lineno"> 266</span>  <span class="comment">// Check p is a vertex of polygon, then it is inside</span></div>
<div class="line"><a name="l00267"></a><span class="lineno"> 267</span>  <span class="keywordflow">if</span>(polygon.at(it)==p)</div>
<div class="line"><a name="l00268"></a><span class="lineno"> 268</span>  <span class="keywordflow">return</span> p;</div>
<div class="line"><a name="l00269"></a><span class="lineno"> 269</span>  <span class="keywordflow">else</span> {</div>
<div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  <span class="comment">// Check if 'polygon[i]' belongs to the line segment from 'p' to 'extreme',</span></div>
<div class="line"><a name="l00271"></a><span class="lineno"> 271</span>  <span class="comment">// if it is then launch another ray using dichotomy search</span></div>
<div class="line"><a name="l00272"></a><span class="lineno"> 272</span>  <span class="keywordflow">if</span>(orientation(p, polygon.at(it), d)==0) {</div>
<div class="line"><a name="l00273"></a><span class="lineno"> 273</span>  d[0] = (d[0] + d2[0])/2;</div>
<div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  d[1] = (d[1] + d2[1])/2;</div>
<div class="line"><a name="l00275"></a><span class="lineno"> 275</span>  belong = <span class="keyword">true</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>  }</div>
<div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  }</div>
<div class="line"><a name="l00279"></a><span class="lineno"> 279</span>  } <span class="keywordflow">while</span> (belong);</div>
<div class="line"><a name="l00280"></a><span class="lineno"> 280</span>  <span class="keywordflow">return</span> d;</div>
<div class="line"><a name="l00281"></a><span class="lineno"> 281</span> }</div>
<div class="line"><a name="l00282"></a><span class="lineno"> 282</span>  </div>
<div class="line"><a name="l00283"></a><span class="lineno"> 283</span> <span class="comment">// Returns true if the point p lies inside the polygon[] with n vertices</span></div>
<div class="line"><a name="l00284"></a><span class="lineno"> 284</span> <span class="keyword">template</span><<span class="keyword">typename</span> TPo<span class="keywordtype">int</span>></div>
<div class="line"><a name="l00285"></a><span class="lineno"> 285</span> <span class="keywordtype">bool</span> isInsidePolygon(<span class="keyword">const</span> std::vector<TPoint>& polygon, TPoint p)</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>  <span class="keywordtype">int</span> n = polygon.size();</div>
<div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  <span class="comment">// There must be at least 3 vertices in polygon[]</span></div>
<div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  <span class="keywordflow">if</span> (n < 3) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l00290"></a><span class="lineno"> 290</span>  </div>
<div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  <span class="comment">// Create a point for line segment from p to infinite</span></div>
<div class="line"><a name="l00292"></a><span class="lineno"> 292</span>  <span class="comment">// Find the direction without containing any polygon vertices</span></div>
<div class="line"><a name="l00293"></a><span class="lineno"> 293</span>  TPoint extreme1 (p[0], INT_MAX/1e6);</div>
<div class="line"><a name="l00294"></a><span class="lineno"> 294</span>  TPoint extreme2 (INT_MAX/1e6, p[1]);</div>
<div class="line"><a name="l00295"></a><span class="lineno"> 295</span>  TPoint extreme = findDirection(polygon, p, extreme1, extreme2);</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>  <span class="comment">// Check p is a vertex of polygon, then it is inside</span></div>
<div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  <span class="keywordflow">if</span>(extreme==p)</div>
<div class="line"><a name="l00299"></a><span class="lineno"> 299</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a name="l00300"></a><span class="lineno"> 300</span>  <span class="comment">// Count intersections of the above line with sides of polygon</span></div>
<div class="line"><a name="l00301"></a><span class="lineno"> 301</span>  <span class="keywordtype">int</span> count = 0, i = 0;</div>
<div class="line"><a name="l00302"></a><span class="lineno"> 302</span>  <span class="keywordflow">do</span></div>
<div class="line"><a name="l00303"></a><span class="lineno"> 303</span>  {</div>
<div class="line"><a name="l00304"></a><span class="lineno"> 304</span>  <span class="keywordtype">int</span> next = (i+1)%n;</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>  <span class="comment">// Check if the line segment from 'p' to 'extreme' intersects</span></div>
<div class="line"><a name="l00307"></a><span class="lineno"> 307</span>  <span class="comment">// with the line segment from 'polygon[i]' to 'polygon[next]'</span></div>
<div class="line"><a name="l00308"></a><span class="lineno"> 308</span>  <span class="keywordflow">if</span> (doIntersect(polygon[i], polygon[next], p, extreme))</div>
<div class="line"><a name="l00309"></a><span class="lineno"> 309</span>  {</div>
<div class="line"><a name="l00310"></a><span class="lineno"> 310</span>  <span class="comment">// If the point 'p' is colinear with line segment 'i-next',</span></div>
<div class="line"><a name="l00311"></a><span class="lineno"> 311</span>  <span class="comment">// then check if it lies on segment. If it lies, return true,</span></div>
<div class="line"><a name="l00312"></a><span class="lineno"> 312</span>  <span class="comment">// otherwise false</span></div>
<div class="line"><a name="l00313"></a><span class="lineno"> 313</span>  <span class="keywordflow">if</span> (orientation(polygon[i], p, polygon[next]) == 0)</div>
<div class="line"><a name="l00314"></a><span class="lineno"> 314</span>  <span class="keywordflow">return</span> onSegment(polygon[i], p, polygon[next]);</div>
<div class="line"><a name="l00315"></a><span class="lineno"> 315</span>  </div>
<div class="line"><a name="l00316"></a><span class="lineno"> 316</span>  count++;</div>
<div class="line"><a name="l00317"></a><span class="lineno"> 317</span>  }</div>
<div class="line"><a name="l00318"></a><span class="lineno"> 318</span>  i = next;</div>
<div class="line"><a name="l00319"></a><span class="lineno"> 319</span>  } <span class="keywordflow">while</span> (i != 0);</div>
<div class="line"><a name="l00320"></a><span class="lineno"> 320</span>  </div>
<div class="line"><a name="l00321"></a><span class="lineno"> 321</span>  <span class="comment">// Return true if count is odd, false otherwise</span></div>
<div class="line"><a name="l00322"></a><span class="lineno"> 322</span>  <span class="keywordflow">return</span> count&1; <span class="comment">// Same as (count%2 == 1)</span></div>
<div class="line"><a name="l00323"></a><span class="lineno"> 323</span> }</div>
<div class="line"><a name="l00324"></a><span class="lineno"> 324</span>  </div>
<div class="line"><a name="l00325"></a><span class="lineno"> 325</span> <span class="comment">// Gauss digitizer</span></div>
<div class="line"><a name="l00326"></a><span class="lineno"> 326</span> std::vector<Z2i::Point> GaussDigization(<span class="keyword">const</span> std::vector<Z2i::Point>& polygon)</div>
<div class="line"><a name="l00327"></a><span class="lineno"> 327</span> {</div>
<div class="line"><a name="l00328"></a><span class="lineno"> 328</span>  <span class="keyword">typedef</span> <a class="codeRef" href="https://dgtal-team.github.io/doc-nightly/classDGtal_1_1PointVector.html">Z2i::Point</a> TPoint;</div>
<div class="line"><a name="l00329"></a><span class="lineno"> 329</span>  std::vector<TPoint> gd;</div>
<div class="line"><a name="l00330"></a><span class="lineno"> 330</span>  std::pair<TPoint, TPoint> bb = getBoundingBox(polygon);</div>
<div class="line"><a name="l00331"></a><span class="lineno"> 331</span>  <span class="keywordtype">int</span> minx = int(bb.first[0])-1;</div>
<div class="line"><a name="l00332"></a><span class="lineno"> 332</span>  <span class="keywordtype">int</span> miny = int(bb.first[1])-1;</div>
<div class="line"><a name="l00333"></a><span class="lineno"> 333</span>  <span class="keywordtype">int</span> maxx = int(bb.second[0])+1;</div>
<div class="line"><a name="l00334"></a><span class="lineno"> 334</span>  <span class="keywordtype">int</span> maxy = int(bb.second[1])+1;</div>
<div class="line"><a name="l00335"></a><span class="lineno"> 335</span>  <span class="keywordflow">for</span>(<span class="keywordtype">int</span> x = minx; x<maxx; x++) {</div>
<div class="line"><a name="l00336"></a><span class="lineno"> 336</span>  <span class="keywordflow">for</span>(<span class="keywordtype">int</span> y = miny; y<maxy; y++) {</div>
<div class="line"><a name="l00337"></a><span class="lineno"> 337</span>  TPoint p(x,y);</div>
<div class="line"><a name="l00338"></a><span class="lineno"> 338</span>  <span class="keywordtype">bool</span> ok = isInsidePolygon<TPoint>(polygon,p);</div>
<div class="line"><a name="l00339"></a><span class="lineno"> 339</span>  <span class="keywordflow">if</span>(ok) {</div>
<div class="line"><a name="l00340"></a><span class="lineno"> 340</span>  TPoint pi(p[0],p[1]);</div>
<div class="line"><a name="l00341"></a><span class="lineno"> 341</span>  gd.push_back(pi);</div>
<div class="line"><a name="l00342"></a><span class="lineno"> 342</span>  }</div>
<div class="line"><a name="l00343"></a><span class="lineno"> 343</span>  }</div>
<div class="line"><a name="l00344"></a><span class="lineno"> 344</span>  }</div>
<div class="line"><a name="l00345"></a><span class="lineno"> 345</span>  <span class="keywordflow">return</span> gd;</div>
<div class="line"><a name="l00346"></a><span class="lineno"> 346</span> }</div>
<div class="ttc" id="a3dHeightMapViewer_8cpp_html_a3c04138a5bfe5d72780bb7e82a18e627"><div class="ttname"><a href="3dHeightMapViewer_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627">main</a></div><div class="ttdeci">int main(int argc, char **argv)</div><div class="ttdef"><b>Definition:</b> <a href="3dHeightMapViewer_8cpp_source.html#l00206">3dHeightMapViewer.cpp:206</a></div></div>
<div class="ttc" id="aclassDGtal_1_1Board2D_html"><div class="ttname"><a href="https://dgtal-team.github.io/doc-nightly/classDGtal_1_1Board2D.html">DGtal::Board2D</a></div></div>
<div class="ttc" id="aclassDGtal_1_1Color_html_aa5e8679bd0da49f95d13cd95a17b619b"><div class="ttname"><a href="https://dgtal-team.github.io/doc-nightly/classDGtal_1_1Color.html#aa5e8679bd0da49f95d13cd95a17b619b">DGtal::Color::Red</a></div><div class="ttdeci">static const Color Red</div></div>
<div class="ttc" id="aclassDGtal_1_1HyperRectDomain_html"><div class="ttname"><a href="https://dgtal-team.github.io/doc-nightly/classDGtal_1_1HyperRectDomain.html">HyperRectDomain< Space ></a></div></div>
<div class="ttc" id="aclassDGtal_1_1ImageContainerBySTLVector_html"><div class="ttname"><a href="https://dgtal-team.github.io/doc-nightly/classDGtal_1_1ImageContainerBySTLVector.html">DGtal::ImageContainerBySTLVector</a></div></div>
<div class="ttc" id="aclassDGtal_1_1Image_html"><div class="ttname"><a href="https://dgtal-team.github.io/doc-nightly/classDGtal_1_1Image.html">DGtal::Image</a></div></div>
<div class="ttc" id="aclassDGtal_1_1PointVector_html"><div class="ttname"><a href="https://dgtal-team.github.io/doc-nightly/classDGtal_1_1PointVector.html">PointVector< dim, Integer ></a></div></div>
<div class="ttc" id="aclassDGtal_1_1Trace_html_a1e786a1f3b1047e92b73c82f67e3c295"><div class="ttname"><a href="https://dgtal-team.github.io/doc-nightly/classDGtal_1_1Trace.html#a1e786a1f3b1047e92b73c82f67e3c295">DGtal::Trace::error</a></div><div class="ttdeci">std::ostream & error()</div></div>
<div class="ttc" id="aclassLibBoard_1_1Board_html_a0c38953e04956d357afa05c9734178f2"><div class="ttname"><a href="https://dgtal-team.github.io/doc-nightly/classLibBoard_1_1Board.html#a0c38953e04956d357afa05c9734178f2">LibBoard::Board::setPenColor</a></div><div class="ttdeci">Board & setPenColor(const DGtal::Color &color)</div></div>
<div class="ttc" id="aclassLibBoard_1_1Board_html_a64cfaa0d8e99ffe65b99c7be040fbbc5"><div class="ttname"><a href="https://dgtal-team.github.io/doc-nightly/classLibBoard_1_1Board.html#a64cfaa0d8e99ffe65b99c7be040fbbc5">LibBoard::Board::drawLine</a></div><div class="ttdeci">void drawLine(double x1, double y1, double x2, double y2, int depthValue=-1)</div></div>
<div class="ttc" id="aclassLibBoard_1_1Board_html_ac188d9b5f030366abc53d6fd46b14c3b"><div class="ttname"><a href="https://dgtal-team.github.io/doc-nightly/classLibBoard_1_1Board.html#ac188d9b5f030366abc53d6fd46b14c3b">LibBoard::Board::setLineWidth</a></div><div class="ttdeci">Board & setLineWidth(double width)</div></div>
<div class="ttc" id="aclassLibBoard_1_1Board_html_adab1403965fea54c0de9bfe38e1e6724"><div class="ttname"><a href="https://dgtal-team.github.io/doc-nightly/classLibBoard_1_1Board.html#adab1403965fea54c0de9bfe38e1e6724">LibBoard::Board::saveSVG</a></div><div class="ttdeci">void saveSVG(const char *filename, PageSize size=Board::BoundingBox, double margin=10.0) const</div></div>
<div class="ttc" id="anamespaceDGtal_1_1Z2i_html_ac0a04516c81db6f4a583eddda0f64875"><div class="ttname"><a href="https://dgtal-team.github.io/doc-nightly/namespaceDGtal_1_1Z2i.html#ac0a04516c81db6f4a583eddda0f64875">DGtal::Z2i::Point</a></div><div class="ttdeci">Space::Point Point</div></div>
<div class="ttc" id="anamespaceDGtal_html"><div class="ttname"><a href="namespaceDGtal.html">DGtal</a></div></div>
<div class="ttc" id="anamespaceDGtal_html_a604c07ec391ad12a1f3fb6479993f112"><div class="ttname"><a href="https://dgtal-team.github.io/doc-nightly/namespaceDGtal.html#a604c07ec391ad12a1f3fb6479993f112">DGtal::trace</a></div><div class="ttdeci">Trace trace(traceWriterTerm)</div></div>
<div class="ttc" id="astructDGtal_1_1PGMWriter_html_aea1f9f2729f8da56df859a813bf5250b"><div class="ttname"><a href="https://dgtal-team.github.io/doc-nightly/structDGtal_1_1PGMWriter.html#aea1f9f2729f8da56df859a813bf5250b">DGtal::PGMWriter::exportPGM</a></div><div class="ttdeci">static bool exportPGM(const std::string &filename, const Image &aImage, const Functor &aFunctor=Functor(), bool saveASCII=false, bool topbotomOrder=true)</div></div>
<div class="ttc" id="astructDGtal_1_1PointListReader_html_a7aa38c2b50493b7437533d410ffed20a"><div class="ttname"><a href="https://dgtal-team.github.io/doc-nightly/structDGtal_1_1PointListReader.html#a7aa38c2b50493b7437533d410ffed20a">DGtal::PointListReader::getPointsFromFile</a></div><div class="ttdeci">static std::vector< TPoint > getPointsFromFile(const std::string &filename, std::vector< unsigned int > aVectPosition=std::vector< unsigned int >())</div></div>
<div class="ttc" id="astructDGtal_1_1SetMode_html"><div class="ttname"><a href="https://dgtal-team.github.io/doc-nightly/structDGtal_1_1SetMode.html">DGtal::SetMode</a></div></div>
</div><!-- fragment --></div><!-- contents -->
<!-- HTML footer for doxygen 1.8.11-->
<!-- start footer part -->
<hr class="footer"/><address class="footer"><small>
Companion project associated to <a href= "http://liris.cnrs.fr/dgtal/doc/nightly/"> DGtal </a>;
Generated on Mon Aug 26 2024 21:31:30 for DGtalTools by  <a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/>
</a> 1.9.1
</small></address>
</body>
</html>