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
|
//
// Copyright (C) : Please refer to the COPYRIGHT file distributed
// with this source distribution.
//
// This program is free software; you can redistribute it and/or
// modify it under the terms of the GNU General Public License
// as published by the Free Software Foundation; either version 2
// of the License, or (at your option) any later version.
//
// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
//
// You should have received a copy of the GNU General Public License
// along with this program; if not, write to the Free Software
// Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
//
///////////////////////////////////////////////////////////////////////////////
#include "Chain.h"
#include "../view_map/ViewMapIterators.h"
#include "../view_map/ViewMapAdvancedIterators.h"
void Chain::push_viewedge_back(ViewEdge *iViewEdge, bool orientation)
{
ViewEdge::vertex_iterator v;
ViewEdge::vertex_iterator vend;
ViewEdge::vertex_iterator vfirst;
Vec3r previous, current;
if(true == orientation)
{
v=iViewEdge->vertices_begin();
vfirst = v;
vend=iViewEdge->vertices_end();
}
else
{
v=iViewEdge->vertices_last();
vfirst = v;
vend=iViewEdge->vertices_end();
}
if(!_Vertices.empty())
{
previous = _Vertices.back()->point2d();
if(orientation)
++v;
else
--v;
}
else
previous = (*v)->point2d();
do{
current = (*v)->point2d();
Curve::push_vertex_back(*v);
//_Length += (current-previous).norm();
previous = current;
if(orientation)
++v;
else
--v;
}while((v!=vend) && (v!=vfirst));
if(v==vfirst)
{
//Add last one:
current = (*v)->point2d();
Curve::push_vertex_back(*v);
//_Length += (current-previous).norm();
}
}
void Chain::push_viewedge_front(ViewEdge *iViewEdge, bool orientation)
{
orientation = !orientation;
ViewEdge::vertex_iterator v;
ViewEdge::vertex_iterator vend;
ViewEdge::vertex_iterator vfirst;
Vec3r previous, current;
if(true == orientation)
{
v=iViewEdge->vertices_begin();
vfirst = v;
vend=iViewEdge->vertices_end();
}
else
{
v=iViewEdge->vertices_last();
vfirst = v;
vend=iViewEdge->vertices_end();
}
if(!_Vertices.empty())
{
previous = _Vertices.front()->point2d();
if(orientation)
++v;
else
--v;
}
else
previous = (*v)->point2d();
do{
current = (*v)->point2d();
Curve::push_vertex_front((*v));
//_Length += (current-previous).norm();
previous = current;
if(orientation)
++v;
else
--v;
}while((v!=vend) && (v!=vfirst));
if(v==vfirst)
{
//Add last one:
current = (*v)->point2d();
Curve::push_vertex_front(*v);
//_Length += (current-previous).norm();
}
}
|
