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
|
## Copyright (C) 2024 David Legland
## All rights reserved.
##
## Redistribution and use in source and binary forms, with or without
## modification, are permitted provided that the following conditions are met:
##
## 1 Redistributions of source code must retain the above copyright notice,
## this list of conditions and the following disclaimer.
## 2 Redistributions in binary form must reproduce the above copyright
## notice, this list of conditions and the following disclaimer in the
## documentation and/or other materials provided with the distribution.
##
## THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS ''AS IS''
## AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
## IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
## ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE FOR
## ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
## DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
## SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
## CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
## OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
## OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
##
## The views and conclusions contained in the software and documentation are
## those of the authors and should not be interpreted as representing official
## policies, either expressed or implied, of the copyright holders.
function [nodes, edges, faces] = gcontour3d(img)
%GCONTOUR3D Create contour graph of a 3D binary image.
%
% deprecated: use imageBoundaryGraph instead
%
% See also
% imageBoundaryGraph
% ------
% Author: David Legland
% E-mail: david.legland@inrae.fr
% Created: 2004-06-28
% Copyright 2004-2023 INRA - TPV URPOI - BIA IMASTE
nodes = zeros([0 3]); % 3 coordinates vertices
edges = zeros([0 2]); % first node and second nodes
faces = zeros([0 4]); % indices of 4 corners of each square face
D1 = size(img, 1);
D2 = size(img, 2);
D3 = size(img, 3);
% first direction for image
for y = 1:D2
for z = 1:D3
% find transitions between the two phases
ind = find(img(1:D1-1, y, z)~=img(2:D1, y, z));
% process each transition in direction 1
for i2 = 1:length(ind)
% coordinates of each node
n1 = [ind(i2)+.5 y-.5 z-.5];
n2 = [ind(i2)+.5 y-.5 z+.5];
n3 = [ind(i2)+.5 y+.5 z+.5];
n4 = [ind(i2)+.5 y+.5 z-.5];
% add the face (and edges) with the 4 given nodes
[nodes, edges, faces] = addFace(nodes, edges, faces, [n1; n2; n3; n4]);
end
end
end
% second direction for image
for x=1:D1
for z=1:D3
% find transitions between the two phases
ind = find(img(x, 1:D2-1, z)~=img(x, 2:D2, z));
% process each transition in direction 1
for i2 = 1:length(ind)
% coordinates of each node
n1 = [x-.5 ind(i2)+.5 z-.5];
n2 = [x-.5 ind(i2)+.5 z+.5];
n3 = [x+.5 ind(i2)+.5 z+.5];
n4 = [x+.5 ind(i2)+.5 z-.5];
% add the face (and edges) with the 4 given nodes
[nodes, edges, faces] = addFace(nodes, edges, faces, [n1; n2; n3; n4]);
end
end
end
% third direction for image
for x=1:D1
for y=1:D2
% find transitions between the two phases
ind = find(img(x, y, 1:D3-1)~=img(x, y, 2:D3));
% process each transition in direction 1
for i2 = 1:length(ind)
% coordinates of each node
n1 = [x-.5 y-.5 ind(i2)+.5];
n2 = [x-.5 y+.5 ind(i2)+.5];
n3 = [x+.5 y+.5 ind(i2)+.5];
n4 = [x+.5 y-.5 ind(i2)+.5];
% add the face (and edges) with the 4 given nodes
[nodes, edges, faces] = addFace(nodes, edges, faces, [n1; n2; n3; n4]);
end
end
end
return;
function [nodes, edges, faces] = addFace(nodes, edges, faces, faceNodes)
% add given nodes and coresponding face to the graph.
n1 = faceNodes(1,:);
n2 = faceNodes(2,:);
n3 = faceNodes(3,:);
n4 = faceNodes(4,:);
% search indices of each nodes
ind1 = find(ismember(nodes, n1, 'rows'));
ind2 = find(ismember(nodes, n2, 'rows'));
ind3 = find(ismember(nodes, n3, 'rows'));
ind4 = find(ismember(nodes, n4, 'rows'));
% if nodes are not in the list, we add them
if isempty(ind1)
nodes = [nodes; n1];
ind1 = size(nodes, 1);
end
if isempty(ind2)
nodes = [nodes; n2];
ind2 = size(nodes, 1);
end
if isempty(ind3)
nodes = [nodes; n3];
ind3 = size(nodes, 1);
end
if isempty(ind4)
nodes = [nodes; n4];
ind4 = size(nodes, 1);
end
% add current face to the list
faces(size(faces, 1)+1, 1:4) = [ind1(1) ind2(1) ind3(1) ind4(1)];
% create edges of the face
% (first index is the smallest one, by convention)
e1 = [min(ind1, ind2) max(ind1, ind2)];
e2 = [min(ind2, ind3) max(ind2, ind3)];
e3 = [min(ind3, ind4) max(ind3, ind4)];
e4 = [min(ind4, ind1) max(ind4, ind1)];
% if nodes are not in the list, we add them
if isempty(find(ismember(edges, e1, 'rows'), 1))
edges = [edges; e1];
end
if isempty(find(ismember(edges, e2, 'rows'), 1))
edges = [edges; e2];
end
if isempty(find(ismember(edges, e3, 'rows'), 1))
edges = [edges; e3];
end
if isempty(find(ismember(edges, e4, 'rows'), 1))
edges = [edges; e4];
end
|
