-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathreconstructProfile.m
More file actions
176 lines (160 loc) · 5.76 KB
/
reconstructProfile.m
File metadata and controls
176 lines (160 loc) · 5.76 KB
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
function Q = reconstructProfile(p,Np)
%{
DESCRIPTION
Order sectional profile points estimated from wlls
regression and remove points with undesired connectivity deviating from
underlying curve.
NOTES
Adapted from Ghorbani, H., Khameneifar, F. 2021. Airfoil profile
reconstruction from unorganized noisy point cloud data. Journal of
Computational Design and Engineering 8(2):740-755.
REQUIRED INPUTS
p - mx2 matrix: points projected onto thin sectional curve estimated
from wlls regression
Np - mx2 matrix: improved normal vectors for each sectional point
estimated from wlls regression
OUTPUTS
Q - mx2 matrix: thinned, ordered sectional points
Copyright 2025 Daniel C. Burcham
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
%}
% Initial reconstruction (nodes ordered CCW)
E = zeros(size(p,1),2);
for i = 1:size(p,1)
pos = zeros(size(p,1),1);
for ia = 1:size(p,1)
pos(ia,1) = sign(det([Np(i,1) Np(i,2);...
p(ia,1)-p(i,1) p(ia,2)-p(i,2)]));
end
s1 = p(pos < 0,:);
s2 = p(pos > 0,:);
[idx1,~] = knnsearch(s1,p(i,:),'K',1);
[idx2,~] = knnsearch(s2,p(i,:),'K',1);
[~,Loc1] = ismember(s1(idx1,:), p(:,1:2), 'rows');
[~,Loc2] = ismember(s2(idx2,:), p(:,1:2), 'rows');
E(i,:) = [Loc1 Loc2];
end
% Imperfect node modification
% Find indices of rows with connections to the same preceding and trailing nodes
[C1,~,ic1] = unique(E,'rows','stable');
cts1 = [C1, accumarray(ic1,1)];
cts1 = cts1(cts1(:,3)>1,:);
ids = ismember(E,cts1(:,1:2),'rows');
ids1 = zeros(sum(cts1(:,3)),3);
ids1(:,1) = find(ids);
ids1(:,2:3) = E(ids1(:,1),:);
Tp = [-1.*Np(ids1(:,2),2) Np(ids1(:,2),1)]; % Tangent vector
% Edge vector
e = [p(ids1(:,1),1)-p(ids1(:,2),1) p(ids1(:,1),2)-p(ids1(:,2),2)]./...
norm([p(ids1(:,1),1)-p(ids1(:,2),1) p(ids1(:,1),2)-p(ids1(:,2),2)]);
theta = atan2d(norm(cross([Tp zeros(size(Tp,1),1)],[e zeros(size(e,1),1)],2)),...
dot([Tp zeros(size(Tp,1),1)],[e zeros(size(e,1),1)],2));
idx = zeros(size(cts1,1),1);
for i = 1:size(cts1,1)
mx = max(theta(ismember(ids1(:,2:3),cts1(i,1:2),'rows')));
idx(i) = ids1(theta==mx,1);
end
p(idx,:) = [];
Np(idx,:) = [];
E = zeros(size(p,1),2);
for i = 1:size(p,1)
pos = zeros(size(p,1),1);
for ia = 1:size(p,1)
pos(ia,1) = sign(det([Np(i,1) Np(i,2);...
p(ia,1)-p(i,1) p(ia,2)-p(i,2)]));
end
s1 = p(pos < 0,:);
s2 = p(pos > 0,:);
[idx1,~] = knnsearch(s1(:,1:2),p(i,:),'K',1);
[idx2,~] = knnsearch(s2(:,1:2),p(i,:),'K',1);
[~,Loc1] = ismember(s1(idx1,:), p(:,1:2), 'rows');
[~,Loc2] = ismember(s2(idx2,:), p(:,1:2), 'rows');
E(i,:) = [Loc1 Loc2];
end
% Find indices of rows with connections to the same preceding nodes
[C2,~,ic2] = unique(E(:,1),'stable');
cts2 = [C2, accumarray(ic2,1)];
cts2 = cts2(cts2(:,2)>1,:);
[~,ids] = ismember(E(:,1),cts2(:,1),'rows');
ids2 = zeros(sum(cts2(:,2)),3);
ids2(:,1) = find(ids);
ids2(:,2:3) = E(ids2(:,1),:);
Tp = [-1.*Np(ids2(:,2),2) Np(ids2(:,2),1)]; % Tangent vector
e = [p(ids2(:,1),1)-p(ids2(:,2),1) p(ids2(:,1),2)-p(ids2(:,2),2)]./...
norm([p(ids2(:,1),1)-p(ids2(:,2),1) p(ids2(:,1),2)-p(ids2(:,2),2)]);
theta = atan2d(norm(cross([Tp zeros(size(Tp,1),1)],[e zeros(size(e,1),1)],2)),...
dot([Tp zeros(size(Tp,1),1)],[e zeros(size(e,1),1)],2));
idx = zeros(size(cts2,1),1);
for i=1:size(cts2,1)
[~,ix] = max(theta(ids2(:,2)==cts2(i,1)));
tmp = ids2(ids2(:,2)==cts2(i,1));
idx(i) = tmp(ix,1);
end
p(idx,:) = [];
Np(idx,:) = [];
E = zeros(size(p,1),2);
for i = 1:size(p,1)
pos = zeros(size(p,1),1);
for ia = 1:size(p,1)
pos(ia,1) = sign(det([Np(i,1) Np(i,2);...
p(ia,1)-p(i,1) p(ia,2)-p(i,2)]));
end
s1 = p(pos < 0,:);
s2 = p(pos > 0,:);
[idx1,~] = knnsearch(s1(:,1:2),p(i,:),'K',1);
[idx2,~] = knnsearch(s2(:,1:2),p(i,:),'K',1);
[~,Loc1] = ismember(s1(idx1,:), p(:,1:2), 'rows');
[~,Loc2] = ismember(s2(idx2,:), p(:,1:2), 'rows');
E(i,:) = [Loc1 Loc2];
end
% Find indices of rows with connections to the same trailing nodes
[C3,~,ic3] = unique(E(:,2),'stable');
cts3 = [C3, accumarray(ic3,1)];
cts3 = cts3(cts3(:,2)>1,:);
[~,ids] = ismember(E(:,2),cts3(:,1),'rows');
ids3 = zeros(sum(cts3(:,2)),3);
ids3(:,1) = find(ids);
ids3(:,2:3) = E(ids3(:,1),:);
Tp = [-1.*Np(ids3(:,2),2) Np(ids3(:,2),1)]; % Tangent vector
e = [p(ids3(:,1),1)-p(ids3(:,2),1) p(ids3(:,1),2)-p(ids3(:,2),2)]./...
norm([p(ids3(:,1),1)-p(ids3(:,2),1) p(ids3(:,1),2)-p(ids3(:,2),2)]);
theta = atan2d(norm(cross([Tp zeros(size(Tp,1),1)],[e zeros(size(e,1),1)],2)),...
dot([Tp zeros(size(Tp,1),1)],[e zeros(size(e,1),1)],2));
idx = zeros(size(cts3,1),1);
for i=1:size(cts3,1)
[~,ix] = max(theta(ids3(:,3)==cts3(i,1)));
tmp = ids3(ids3(:,3)==cts3(i,1));
idx(i) = tmp(ix,1);
end
p(tmp(ix,1),:) = [];
Np(tmp(ix,1),:) = [];
E = zeros(size(p,1),2);
for i = 1:size(p,1)
pos = zeros(size(p,1),1);
for ia = 1:size(p,1)
pos(ia,1) = sign(det([Np(i,1) Np(i,2);...
p(ia,1)-p(i,1) p(ia,2)-p(i,2)]));
end
s1 = p(pos < 0,:);
s2 = p(pos > 0,:);
[idx1,~] = knnsearch(s1(:,1:2),p(i,:),'K',1);
[idx2,~] = knnsearch(s2(:,1:2),p(i,:),'K',1);
[~,Loc1] = ismember(s1(idx1,:), p(:,1:2), 'rows');
[~,Loc2] = ismember(s2(idx2,:), p(:,1:2), 'rows');
E(i,:) = [Loc1 Loc2];
end
orderP = zeros(size(p,1),1);
orderP(1) = 1;
for i = 2:size(orderP,1)
orderP(i)=E(orderP(i-1),2);
end
Q = p(orderP,:);
end