1
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
2
<html xmlns="http://www.w3.org/1999/xhtml">
4
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
5
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
6
<title>tesseract: /usr/local/google/home/jbreiden/tesseract-ocr-read-only/cube/con_comp.cpp Source File</title>
8
<link href="tabs.css" rel="stylesheet" type="text/css"/>
9
<link href="doxygen.css" rel="stylesheet" type="text/css" />
10
<link href="navtree.css" rel="stylesheet" type="text/css"/>
11
<script type="text/javascript" src="jquery.js"></script>
12
<script type="text/javascript" src="resize.js"></script>
13
<script type="text/javascript" src="navtree.js"></script>
14
<script type="text/javascript">
15
$(document).ready(initResizable);
17
<link href="search/search.css" rel="stylesheet" type="text/css"/>
18
<script type="text/javascript" src="search/search.js"></script>
19
<script type="text/javascript">
20
$(document).ready(function() { searchBox.OnSelectItem(0); });
25
<div id="top"><!-- do not remove this div! -->
29
<table cellspacing="0" cellpadding="0">
31
<tr style="height: 56px;">
34
<td style="padding-left: 0.5em;">
35
<div id="projectname">tesseract
36
 <span id="projectnumber">3.03</span>
48
<!-- Generated by Doxygen 1.7.6.1 -->
49
<script type="text/javascript">
50
var searchBox = new SearchBox("searchBox", "search",false,'Search');
52
<div id="navrow1" class="tabs">
54
<li><a href="index.html"><span>Main Page</span></a></li>
55
<li><a href="pages.html"><span>Related Pages</span></a></li>
56
<li><a href="modules.html"><span>Modules</span></a></li>
57
<li><a href="namespaces.html"><span>Namespaces</span></a></li>
58
<li><a href="annotated.html"><span>Classes</span></a></li>
59
<li class="current"><a href="files.html"><span>Files</span></a></li>
61
<div id="MSearchBox" class="MSearchBoxInactive">
63
<img id="MSearchSelect" src="search/mag_sel.png"
64
onmouseover="return searchBox.OnSearchSelectShow()"
65
onmouseout="return searchBox.OnSearchSelectHide()"
67
<input type="text" id="MSearchField" value="Search" accesskey="S"
68
onfocus="searchBox.OnSearchFieldFocus(true)"
69
onblur="searchBox.OnSearchFieldFocus(false)"
70
onkeyup="searchBox.OnSearchFieldChange(event)"/>
71
</span><span class="right">
72
<a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a>
78
<div id="navrow2" class="tabs2">
80
<li><a href="files.html"><span>File List</span></a></li>
81
<li><a href="globals.html"><span>File Members</span></a></li>
85
<div id="side-nav" class="ui-resizable side-nav-resizable">
87
<div id="nav-tree-contents">
90
<div id="splitbar" style="-moz-user-select:none;"
91
class="ui-resizable-handle">
94
<script type="text/javascript">
95
initNavTree('a00975.html','');
97
<div id="doc-content">
99
<div class="headertitle">
100
<div class="title">/usr/local/google/home/jbreiden/tesseract-ocr-read-only/cube/con_comp.cpp</div> </div>
102
<div class="contents">
103
<a href="a00975.html">Go to the documentation of this file.</a><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">/**********************************************************************</span>
104
<a name="l00002"></a>00002 <span class="comment"> * File: con_comp.cpp</span>
105
<a name="l00003"></a>00003 <span class="comment"> * Description: Implementation of a Connected Component class</span>
106
<a name="l00004"></a>00004 <span class="comment"> * Author: Ahmad Abdulkader</span>
107
<a name="l00005"></a>00005 <span class="comment"> * Created: 2007</span>
108
<a name="l00006"></a>00006 <span class="comment"> *</span>
109
<a name="l00007"></a>00007 <span class="comment"> * (C) Copyright 2008, Google Inc.</span>
110
<a name="l00008"></a>00008 <span class="comment"> ** Licensed under the Apache License, Version 2.0 (the "License");</span>
111
<a name="l00009"></a>00009 <span class="comment"> ** you may not use this file except in compliance with the License.</span>
112
<a name="l00010"></a>00010 <span class="comment"> ** You may obtain a copy of the License at</span>
113
<a name="l00011"></a>00011 <span class="comment"> ** http://www.apache.org/licenses/LICENSE-2.0</span>
114
<a name="l00012"></a>00012 <span class="comment"> ** Unless required by applicable law or agreed to in writing, software</span>
115
<a name="l00013"></a>00013 <span class="comment"> ** distributed under the License is distributed on an "AS IS" BASIS,</span>
116
<a name="l00014"></a>00014 <span class="comment"> ** WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.</span>
117
<a name="l00015"></a>00015 <span class="comment"> ** See the License for the specific language governing permissions and</span>
118
<a name="l00016"></a>00016 <span class="comment"> ** limitations under the License.</span>
119
<a name="l00017"></a>00017 <span class="comment"> *</span>
120
<a name="l00018"></a>00018 <span class="comment"> **********************************************************************/</span>
121
<a name="l00019"></a>00019
122
<a name="l00020"></a>00020 <span class="preprocessor">#include <stdlib.h></span>
123
<a name="l00021"></a>00021 <span class="preprocessor">#include <string.h></span>
124
<a name="l00022"></a>00022 <span class="preprocessor">#include "<a class="code" href="a00976.html">con_comp.h</a>"</span>
125
<a name="l00023"></a>00023 <span class="preprocessor">#include "<a class="code" href="a00979.html">cube_const.h</a>"</span>
126
<a name="l00024"></a>00024
127
<a name="l00025"></a>00025 <span class="keyword">namespace </span><a class="code" href="a01266.html#afed58feacb84df2de88bdd613cfdba6d">tesseract</a> {
128
<a name="l00026"></a>00026
129
<a name="l00027"></a><a class="code" href="a00328.html#a9c1a56e98d961c0897204ddc3dc34dcc">00027</a> <a class="code" href="a00328.html#a9c1a56e98d961c0897204ddc3dc34dcc">ConComp::ConComp</a>() {
130
<a name="l00028"></a>00028 head_ = NULL;
131
<a name="l00029"></a>00029 tail_ = NULL;
132
<a name="l00030"></a>00030 left_ = 0;
133
<a name="l00031"></a>00031 top_ = 0;
134
<a name="l00032"></a>00032 right_ = 0;
135
<a name="l00033"></a>00033 bottom_ = 0;
136
<a name="l00034"></a>00034 left_most_ = <span class="keyword">false</span>;
137
<a name="l00035"></a>00035 right_most_ = <span class="keyword">false</span>;
138
<a name="l00036"></a>00036 id_ = -1;
139
<a name="l00037"></a>00037 pt_cnt_ = 0;
140
<a name="l00038"></a>00038 }
141
<a name="l00039"></a>00039
142
<a name="l00040"></a><a class="code" href="a00328.html#afdd2ae13689464919d6b8518ac96bf4f">00040</a> <a class="code" href="a00328.html#afdd2ae13689464919d6b8518ac96bf4f">ConComp::~ConComp</a>() {
143
<a name="l00041"></a>00041 <span class="keywordflow">if</span> (head_ != NULL) {
144
<a name="l00042"></a>00042 <a class="code" href="a00329.html">ConCompPt</a> *pt_ptr = head_;
145
<a name="l00043"></a>00043 <span class="keywordflow">while</span> (pt_ptr != NULL) {
146
<a name="l00044"></a>00044 <a class="code" href="a00329.html">ConCompPt</a> *pptNext = pt_ptr-><a class="code" href="a00329.html#a882e8dded6715bdc77f241f40c2e222d">Next</a>();
147
<a name="l00045"></a>00045 <span class="keyword">delete</span> pt_ptr;
148
<a name="l00046"></a>00046 pt_ptr = pptNext;
149
<a name="l00047"></a>00047 }
150
<a name="l00048"></a>00048 head_ = NULL;
151
<a name="l00049"></a>00049 }
152
<a name="l00050"></a>00050 }
153
<a name="l00051"></a>00051
154
<a name="l00052"></a>00052 <span class="comment">// adds a pt to the conn comp and updates its boundaries</span>
155
<a name="l00053"></a><a class="code" href="a00328.html#a52603a07411f89ea2858d7dc458c69ec">00053</a> <span class="keywordtype">bool</span> <a class="code" href="a00328.html#a52603a07411f89ea2858d7dc458c69ec">ConComp::Add</a>(<span class="keywordtype">int</span> x, <span class="keywordtype">int</span> y) {
156
<a name="l00054"></a>00054 <a class="code" href="a00329.html">ConCompPt</a> *pt_ptr = <span class="keyword">new</span> <a class="code" href="a00329.html">ConCompPt</a>(x, y);
157
<a name="l00055"></a>00055 <span class="keywordflow">if</span> (pt_ptr == NULL) {
158
<a name="l00056"></a>00056 <span class="keywordflow">return</span> <span class="keyword">false</span>;
159
<a name="l00057"></a>00057 }
160
<a name="l00058"></a>00058
161
<a name="l00059"></a>00059 <span class="keywordflow">if</span> (head_ == NULL) {
162
<a name="l00060"></a>00060 left_ = x;
163
<a name="l00061"></a>00061 right_ = x;
164
<a name="l00062"></a>00062 top_ = y;
165
<a name="l00063"></a>00063 bottom_ = y;
166
<a name="l00064"></a>00064
167
<a name="l00065"></a>00065 head_ = pt_ptr;
168
<a name="l00066"></a>00066 } <span class="keywordflow">else</span> {
169
<a name="l00067"></a>00067 left_ = left_ <= x ? left_ : x;
170
<a name="l00068"></a>00068 top_ = top_ <= y ? top_ : y;
171
<a name="l00069"></a>00069 right_ = right_ >= x ? right_ : x;
172
<a name="l00070"></a>00070 bottom_ = bottom_ >= y ? bottom_ : y;
173
<a name="l00071"></a>00071 }
174
<a name="l00072"></a>00072
175
<a name="l00073"></a>00073 <span class="keywordflow">if</span> (tail_ != NULL) {
176
<a name="l00074"></a>00074 tail_-><a class="code" href="a00329.html#a2e2ac0de4ad019925913b08fe0693b1b">SetNext</a>(pt_ptr);
177
<a name="l00075"></a>00075 }
178
<a name="l00076"></a>00076
179
<a name="l00077"></a>00077 tail_ = pt_ptr;
180
<a name="l00078"></a>00078 pt_cnt_++;
181
<a name="l00079"></a>00079 <span class="keywordflow">return</span> <span class="keyword">true</span>;
182
<a name="l00080"></a>00080 }
183
<a name="l00081"></a>00081
184
<a name="l00082"></a>00082 <span class="comment">// merges two connected components</span>
185
<a name="l00083"></a><a class="code" href="a00328.html#a95f33b8db94faa8c5688f2f7d2c0854f">00083</a> <span class="keywordtype">bool</span> <a class="code" href="a00328.html#a95f33b8db94faa8c5688f2f7d2c0854f">ConComp::Merge</a>(<a class="code" href="a00328.html">ConComp</a> *concomp) {
186
<a name="l00084"></a>00084 <span class="keywordflow">if</span> (head_ == NULL || tail_ == NULL ||
187
<a name="l00085"></a>00085 concomp->head_ == NULL || concomp->tail_ == NULL) {
188
<a name="l00086"></a>00086 <span class="keywordflow">return</span> <span class="keyword">false</span>;
189
<a name="l00087"></a>00087 }
190
<a name="l00088"></a>00088
191
<a name="l00089"></a>00089 tail_-><a class="code" href="a00329.html#a2e2ac0de4ad019925913b08fe0693b1b">SetNext</a>(concomp->head_);
192
<a name="l00090"></a>00090 tail_ = concomp->tail_;
193
<a name="l00091"></a>00091 left_ = left_ <= concomp->left_ ? left_ : concomp->left_;
194
<a name="l00092"></a>00092 top_ = top_ <= concomp->top_ ? top_ : concomp->top_;
195
<a name="l00093"></a>00093 right_ = right_ >= concomp->right_ ? right_ : concomp->right_;
196
<a name="l00094"></a>00094 bottom_ = bottom_ >= concomp->bottom_ ? bottom_ : concomp->bottom_;
197
<a name="l00095"></a>00095 pt_cnt_ += concomp->pt_cnt_;
198
<a name="l00096"></a>00096
199
<a name="l00097"></a>00097 concomp->head_ = NULL;
200
<a name="l00098"></a>00098 concomp->tail_ = NULL;
201
<a name="l00099"></a>00099
202
<a name="l00100"></a>00100 <span class="keywordflow">return</span> <span class="keyword">true</span>;
203
<a name="l00101"></a>00101 }
204
<a name="l00102"></a>00102
205
<a name="l00103"></a>00103 <span class="comment">// Creates the x-coord density histogram after spreading</span>
206
<a name="l00104"></a>00104 <span class="comment">// each x-coord position by the HIST_WND_RATIO fraction of the</span>
207
<a name="l00105"></a>00105 <span class="comment">// height of the ConComp, but limited to max_hist_wnd</span>
208
<a name="l00106"></a><a class="code" href="a00328.html#addc1f8cbe0d67f961bb956125daa96bc">00106</a> <span class="keywordtype">int</span> *<a class="code" href="a00328.html#addc1f8cbe0d67f961bb956125daa96bc">ConComp::CreateHistogram</a>(<span class="keywordtype">int</span> max_hist_wnd) {
209
<a name="l00107"></a>00107 <span class="keywordtype">int</span> wid = right_ - left_ + 1,
210
<a name="l00108"></a>00108 hgt = bottom_ - top_ + 1,
211
<a name="l00109"></a>00109 hist_wnd = <span class="keyword">static_cast<</span><span class="keywordtype">int</span><span class="keyword">></span>(hgt * <a class="code" href="a00979.html#aec189a023f988ece297cca8b0d492631">HIST_WND_RATIO</a>);
212
<a name="l00110"></a>00110
213
<a name="l00111"></a>00111 <span class="keywordflow">if</span> (hist_wnd > max_hist_wnd) {
214
<a name="l00112"></a>00112 hist_wnd = max_hist_wnd;
215
<a name="l00113"></a>00113 }
216
<a name="l00114"></a>00114
217
<a name="l00115"></a>00115 <span class="comment">// alloc memo for histogram</span>
218
<a name="l00116"></a>00116 <span class="keywordtype">int</span> *hist_array = <span class="keyword">new</span> <span class="keywordtype">int</span>[wid];
219
<a name="l00117"></a>00117 <span class="keywordflow">if</span> (hist_array == NULL) {
220
<a name="l00118"></a>00118 <span class="keywordflow">return</span> NULL;
221
<a name="l00119"></a>00119 }
222
<a name="l00120"></a>00120
223
<a name="l00121"></a>00121 memset(hist_array, 0, wid * <span class="keyword">sizeof</span>(*hist_array));
224
<a name="l00122"></a>00122
225
<a name="l00123"></a>00123 <span class="comment">// compute windowed histogram</span>
226
<a name="l00124"></a>00124 <a class="code" href="a00329.html">ConCompPt</a> *pt_ptr = head_;
227
<a name="l00125"></a>00125
228
<a name="l00126"></a>00126 <span class="keywordflow">while</span> (pt_ptr != NULL) {
229
<a name="l00127"></a>00127 <span class="keywordtype">int</span> x = pt_ptr-><a class="code" href="a00329.html#a229b47fe69fd27215c6c0ea1aedf910a">x</a>() - left_,
230
<a name="l00128"></a>00128 xw = x - hist_wnd;
231
<a name="l00129"></a>00129
232
<a name="l00130"></a>00130 <span class="keywordflow">for</span> (<span class="keywordtype">int</span> xdel = -hist_wnd; xdel <= hist_wnd; xdel++, xw++) {
233
<a name="l00131"></a>00131 <span class="keywordflow">if</span> (xw >= 0 && xw < wid) {
234
<a name="l00132"></a>00132 hist_array[xw]++;
235
<a name="l00133"></a>00133 }
236
<a name="l00134"></a>00134 }
237
<a name="l00135"></a>00135
238
<a name="l00136"></a>00136 pt_ptr = pt_ptr-><a class="code" href="a00329.html#a882e8dded6715bdc77f241f40c2e222d">Next</a>();
239
<a name="l00137"></a>00137 }
240
<a name="l00138"></a>00138
241
<a name="l00139"></a>00139 <span class="keywordflow">return</span> hist_array;
242
<a name="l00140"></a>00140 }
243
<a name="l00141"></a>00141
244
<a name="l00142"></a>00142 <span class="comment">// find out the seg pts by looking for local minima in the histogram</span>
245
<a name="l00143"></a><a class="code" href="a00328.html#ab26e47851c734f02c049e590b9678cee">00143</a> <span class="keywordtype">int</span> *<a class="code" href="a00328.html#ab26e47851c734f02c049e590b9678cee">ConComp::SegmentHistogram</a>(<span class="keywordtype">int</span> *hist_array, <span class="keywordtype">int</span> *seg_pt_cnt) {
246
<a name="l00144"></a>00144 <span class="comment">// init</span>
247
<a name="l00145"></a>00145 (*seg_pt_cnt) = 0;
248
<a name="l00146"></a>00146
249
<a name="l00147"></a>00147 <span class="keywordtype">int</span> wid = right_ - left_ + 1,
250
<a name="l00148"></a>00148 hgt = bottom_ - top_ + 1;
251
<a name="l00149"></a>00149
252
<a name="l00150"></a>00150 <span class="keywordtype">int</span> *x_seg_pt = <span class="keyword">new</span> <span class="keywordtype">int</span>[wid];
253
<a name="l00151"></a>00151 <span class="keywordflow">if</span> (x_seg_pt == NULL) {
254
<a name="l00152"></a>00152 <span class="keywordflow">return</span> NULL;
255
<a name="l00153"></a>00153 }
256
<a name="l00154"></a>00154
257
<a name="l00155"></a>00155 <span class="keywordtype">int</span> seg_pt_wnd = <span class="keyword">static_cast<</span><span class="keywordtype">int</span><span class="keyword">></span>(hgt * <a class="code" href="a00979.html#a2f63172fc6a5989d5934e7154ac0612e">SEG_PT_WND_RATIO</a>);
258
<a name="l00156"></a>00156
259
<a name="l00157"></a>00157 <span class="keywordflow">if</span> (seg_pt_wnd > 1) {
260
<a name="l00158"></a>00158 seg_pt_wnd = 1;
261
<a name="l00159"></a>00159 }
262
<a name="l00160"></a>00160
263
<a name="l00161"></a>00161 <span class="keywordflow">for</span> (<span class="keywordtype">int</span> x = 2; x < (wid - 2); x++) {
264
<a name="l00162"></a>00162 <span class="keywordflow">if</span> (hist_array[x] < hist_array[x - 1] &&
265
<a name="l00163"></a>00163 hist_array[x] < hist_array[x - 2] &&
266
<a name="l00164"></a>00164 hist_array[x] <= hist_array[x + 1] &&
267
<a name="l00165"></a>00165 hist_array[x] <= hist_array[x + 2]) {
268
<a name="l00166"></a>00166 x_seg_pt[(*seg_pt_cnt)++] = x;
269
<a name="l00167"></a>00167 x += seg_pt_wnd;
270
<a name="l00168"></a>00168 } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (hist_array[x] <= hist_array[x - 1] &&
271
<a name="l00169"></a>00169 hist_array[x] <= hist_array[x - 2] &&
272
<a name="l00170"></a>00170 hist_array[x] < hist_array[x + 1] &&
273
<a name="l00171"></a>00171 hist_array[x] < hist_array[x + 2]) {
274
<a name="l00172"></a>00172 x_seg_pt[(*seg_pt_cnt)++] = x;
275
<a name="l00173"></a>00173 x += seg_pt_wnd;
276
<a name="l00174"></a>00174 }
277
<a name="l00175"></a>00175 }
278
<a name="l00176"></a>00176
279
<a name="l00177"></a>00177 <span class="comment">// no segments, nothing to do</span>
280
<a name="l00178"></a>00178 <span class="keywordflow">if</span> ((*seg_pt_cnt) == 0) {
281
<a name="l00179"></a>00179 <span class="keyword">delete</span> []x_seg_pt;
282
<a name="l00180"></a>00180 <span class="keywordflow">return</span> NULL;
283
<a name="l00181"></a>00181 }
284
<a name="l00182"></a>00182
285
<a name="l00183"></a>00183 <span class="keywordflow">return</span> x_seg_pt;
286
<a name="l00184"></a>00184 }
287
<a name="l00185"></a>00185
288
<a name="l00186"></a>00186 <span class="comment">// segments a concomp based on pixel density histogram local minima</span>
289
<a name="l00187"></a>00187 <span class="comment">// if there were none found, it returns NULL</span>
290
<a name="l00188"></a>00188 <span class="comment">// this is more useful than creating a clone of itself</span>
291
<a name="l00189"></a><a class="code" href="a00328.html#a5c8c4ae10cf9097aea4093d9f581088b">00189</a> <a class="code" href="a00328.html">ConComp</a> **<a class="code" href="a00328.html#a5c8c4ae10cf9097aea4093d9f581088b">ConComp::Segment</a>(<span class="keywordtype">int</span> max_hist_wnd, <span class="keywordtype">int</span> *concomp_cnt) {
292
<a name="l00190"></a>00190 <span class="comment">// init</span>
293
<a name="l00191"></a>00191 (*concomp_cnt) = 0;
294
<a name="l00192"></a>00192
295
<a name="l00193"></a>00193 <span class="comment">// No pts</span>
296
<a name="l00194"></a>00194 <span class="keywordflow">if</span> (head_ == NULL) {
297
<a name="l00195"></a>00195 <span class="keywordflow">return</span> NULL;
298
<a name="l00196"></a>00196 }
299
<a name="l00197"></a>00197
300
<a name="l00198"></a>00198 <span class="keywordtype">int</span> seg_pt_cnt = 0;
301
<a name="l00199"></a>00199
302
<a name="l00200"></a>00200 <span class="comment">// create the histogram</span>
303
<a name="l00201"></a>00201 <span class="keywordtype">int</span> *hist_array = <a class="code" href="a00328.html#addc1f8cbe0d67f961bb956125daa96bc">CreateHistogram</a>(max_hist_wnd);
304
<a name="l00202"></a>00202 <span class="keywordflow">if</span> (hist_array == NULL) {
305
<a name="l00203"></a>00203 <span class="keywordflow">return</span> NULL;
306
<a name="l00204"></a>00204 }
307
<a name="l00205"></a>00205
308
<a name="l00206"></a>00206 <span class="keywordtype">int</span> *x_seg_pt = <a class="code" href="a00328.html#ab26e47851c734f02c049e590b9678cee">SegmentHistogram</a>(hist_array, &seg_pt_cnt);
309
<a name="l00207"></a>00207
310
<a name="l00208"></a>00208 <span class="comment">// free histogram</span>
311
<a name="l00209"></a>00209 <span class="keyword">delete</span> []hist_array;
312
<a name="l00210"></a>00210
313
<a name="l00211"></a>00211 <span class="comment">// no segments, nothing to do</span>
314
<a name="l00212"></a>00212 <span class="keywordflow">if</span> (seg_pt_cnt == 0) {
315
<a name="l00213"></a>00213 <span class="keyword">delete</span> []x_seg_pt;
316
<a name="l00214"></a>00214 <span class="keywordflow">return</span> NULL;
317
<a name="l00215"></a>00215 }
318
<a name="l00216"></a>00216
319
<a name="l00217"></a>00217 <span class="comment">// create concomp array</span>
320
<a name="l00218"></a>00218 <a class="code" href="a00328.html">ConComp</a> **concomp_array = <span class="keyword">new</span> <a class="code" href="a00328.html">ConComp</a> *[seg_pt_cnt + 1];
321
<a name="l00219"></a>00219 <span class="keywordflow">if</span> (concomp_array == NULL) {
322
<a name="l00220"></a>00220 <span class="keyword">delete</span> []x_seg_pt;
323
<a name="l00221"></a>00221 <span class="keywordflow">return</span> NULL;
324
<a name="l00222"></a>00222 }
325
<a name="l00223"></a>00223
326
<a name="l00224"></a>00224 <span class="keywordflow">for</span> (<span class="keywordtype">int</span> concomp = 0; concomp <= seg_pt_cnt; concomp++) {
327
<a name="l00225"></a>00225 concomp_array[concomp] = <span class="keyword">new</span> <a class="code" href="a00328.html#a9c1a56e98d961c0897204ddc3dc34dcc">ConComp</a>();
328
<a name="l00226"></a>00226 <span class="keywordflow">if</span> (concomp_array[concomp] == NULL) {
329
<a name="l00227"></a>00227 <span class="keyword">delete</span> []x_seg_pt;
330
<a name="l00228"></a>00228 <span class="keyword">delete</span> []concomp_array;
331
<a name="l00229"></a>00229 <span class="keywordflow">return</span> NULL;
332
<a name="l00230"></a>00230 }
333
<a name="l00231"></a>00231
334
<a name="l00232"></a>00232 <span class="comment">// split concomps inherit the ID this concomp</span>
335
<a name="l00233"></a>00233 concomp_array[concomp]-><a class="code" href="a00328.html#a10dfd3b6b7011094779219ef2b11e6e9">SetID</a>(id_);
336
<a name="l00234"></a>00234 }
337
<a name="l00235"></a>00235
338
<a name="l00236"></a>00236 <span class="comment">// set the left and right most attributes of the</span>
339
<a name="l00237"></a>00237 <span class="comment">// appropriate concomps</span>
340
<a name="l00238"></a>00238 concomp_array[0]->left_most_ = <span class="keyword">true</span>;
341
<a name="l00239"></a>00239 concomp_array[seg_pt_cnt]->right_most_ = <span class="keyword">true</span>;
342
<a name="l00240"></a>00240
343
<a name="l00241"></a>00241 <span class="comment">// assign pts to concomps</span>
344
<a name="l00242"></a>00242 <a class="code" href="a00329.html">ConCompPt</a> *pt_ptr = head_;
345
<a name="l00243"></a>00243 <span class="keywordflow">while</span> (pt_ptr != NULL) {
346
<a name="l00244"></a>00244 <span class="keywordtype">int</span> seg_pt;
347
<a name="l00245"></a>00245
348
<a name="l00246"></a>00246 <span class="comment">// find the first seg-pt that exceeds the x value</span>
349
<a name="l00247"></a>00247 <span class="comment">// of the pt</span>
350
<a name="l00248"></a>00248 <span class="keywordflow">for</span> (seg_pt = 0; seg_pt < seg_pt_cnt; seg_pt++) {
351
<a name="l00249"></a>00249 <span class="keywordflow">if</span> ((x_seg_pt[seg_pt] + left_) > pt_ptr-><a class="code" href="a00329.html#a229b47fe69fd27215c6c0ea1aedf910a">x</a>()) {
352
<a name="l00250"></a>00250 <span class="keywordflow">break</span>;
353
<a name="l00251"></a>00251 }
354
<a name="l00252"></a>00252 }
355
<a name="l00253"></a>00253
356
<a name="l00254"></a>00254 <span class="comment">// add the pt to the proper concomp</span>
357
<a name="l00255"></a>00255 <span class="keywordflow">if</span> (concomp_array[seg_pt]-><a class="code" href="a00328.html#a52603a07411f89ea2858d7dc458c69ec">Add</a>(pt_ptr-><a class="code" href="a00329.html#a229b47fe69fd27215c6c0ea1aedf910a">x</a>(), pt_ptr-><a class="code" href="a00329.html#a017bb1cebad3ba937d69015c9ec9ee91">y</a>()) == <span class="keyword">false</span>) {
358
<a name="l00256"></a>00256 <span class="keyword">delete</span> []x_seg_pt;
359
<a name="l00257"></a>00257 <span class="keyword">delete</span> []concomp_array;
360
<a name="l00258"></a>00258 <span class="keywordflow">return</span> NULL;
361
<a name="l00259"></a>00259 }
362
<a name="l00260"></a>00260
363
<a name="l00261"></a>00261 pt_ptr = pt_ptr-><a class="code" href="a00329.html#a882e8dded6715bdc77f241f40c2e222d">Next</a>();
364
<a name="l00262"></a>00262 }
365
<a name="l00263"></a>00263
366
<a name="l00264"></a>00264 <span class="keyword">delete</span> []x_seg_pt;
367
<a name="l00265"></a>00265
368
<a name="l00266"></a>00266 (*concomp_cnt) = (seg_pt_cnt + 1);
369
<a name="l00267"></a>00267
370
<a name="l00268"></a>00268 <span class="keywordflow">return</span> concomp_array;
371
<a name="l00269"></a>00269 }
372
<a name="l00270"></a>00270
373
<a name="l00271"></a>00271 <span class="comment">// Shifts the co-ordinates of all points by the specified x & y deltas</span>
374
<a name="l00272"></a><a class="code" href="a00328.html#a1e7da8edaf81efc49ea20c48e3f8c668">00272</a> <span class="keywordtype">void</span> <a class="code" href="a00328.html#a1e7da8edaf81efc49ea20c48e3f8c668">ConComp::Shift</a>(<span class="keywordtype">int</span> dx, <span class="keywordtype">int</span> dy) {
375
<a name="l00273"></a>00273 <a class="code" href="a00329.html">ConCompPt</a> *pt_ptr = head_;
376
<a name="l00274"></a>00274
377
<a name="l00275"></a>00275 <span class="keywordflow">while</span> (pt_ptr != NULL) {
378
<a name="l00276"></a>00276 pt_ptr-><a class="code" href="a00329.html#a872af0f3a20b8304efc672ea9d1ea404">Shift</a>(dx, dy);
379
<a name="l00277"></a>00277 pt_ptr = pt_ptr-><a class="code" href="a00329.html#a882e8dded6715bdc77f241f40c2e222d">Next</a>();
380
<a name="l00278"></a>00278 }
381
<a name="l00279"></a>00279
382
<a name="l00280"></a>00280 left_ += dx;
383
<a name="l00281"></a>00281 right_ += dx;
384
<a name="l00282"></a>00282 top_ += dy;
385
<a name="l00283"></a>00283 bottom_ += dy;
386
<a name="l00284"></a>00284 }
387
<a name="l00285"></a>00285
388
<a name="l00286"></a>00286 } <span class="comment">// namespace tesseract</span>
389
</pre></div></div><!-- contents -->
391
<!-- window showing the filter options -->
392
<div id="MSearchSelectWindow"
393
onmouseover="return searchBox.OnSearchSelectShow()"
394
onmouseout="return searchBox.OnSearchSelectHide()"
395
onkeydown="return searchBox.OnSearchSelectKey(event)">
396
<a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(0)"><span class="SelectionMark"> </span>All</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(1)"><span class="SelectionMark"> </span>Classes</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(2)"><span class="SelectionMark"> </span>Namespaces</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(3)"><span class="SelectionMark"> </span>Files</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(4)"><span class="SelectionMark"> </span>Functions</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(5)"><span class="SelectionMark"> </span>Variables</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(6)"><span class="SelectionMark"> </span>Typedefs</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(7)"><span class="SelectionMark"> </span>Enumerations</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(8)"><span class="SelectionMark"> </span>Enumerator</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(9)"><span class="SelectionMark"> </span>Friends</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(10)"><span class="SelectionMark"> </span>Defines</a></div>
398
<!-- iframe showing the search results (closed by default) -->
399
<div id="MSearchResultsWindow">
400
<iframe src="javascript:void(0)" frameborder="0"
401
name="MSearchResults" id="MSearchResults">
405
<div id="nav-path" class="navpath">
407
<li class="navelem"><a class="el" href="a00975.html">con_comp.cpp</a> </li>
409
<li class="footer">Generated on Mon Feb 3 2014 10:59:09 for tesseract by
410
<a href="http://www.doxygen.org/index.html">
411
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.7.6.1 </li>
added
removed
doc/html/a00975_source.html
