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
|
## 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 varargout = fillGraphFaces(varargin)
%FILLGRAPHFACES Fill faces of a graph with specified color.
%
% fillGraphFaces(NODES, FACES)
% draw the faces of a graph / mesh defined by a sef of vertices and a set
% of faces. The array NODES is a NV-by-2 or NV-by-3 array containing
% vertex coordinates. The array FACES is either a NF-by-3 or NF-by-4
% array of integers, or a 1-by-Nf array of cells, and contains indices of
% each face vertices.
%
% fillGraphFaces(NODES, EDGES, FACES)
% also specifies the edges ofthe graph.
%
% fillGraphFaces(GRAPH)
% passes argument in a srtucture with at least 3 fields named 'nodes',
% 'edges', and 'faces', corresponding to previously described parameters.
% GRAPH can also be a cell array, whose first element is node array,
% second element is edges array, and third element, if present, is faces
% array.
%
% fillGraphFaces(..., SFACES)
% specifes the draw mode for each element, as in the classical 'plot'
% function. To not display some elements, uses 'none'.
%
% H = fillGraphFaces(...)
% return handle to the set of faces.
%
% See also
% graphs, drawGraph, drawGraphEdges
%
% ------
% Author: David Legland
% E-mail: david.legland@inrae.fr
% Created: 2005-11-24
% Copyright 2005-2023 INRA - CEPIA Nantes - MIAJ (Jouy-en-Josas)
%% Initialisations
% drawing style for filling faces. Default is cyan.
faceColor = 'c';
%% Process input arguments
% if called without argument, display usage
if nargin == 0
help fillGraphFaces;
return;
end
% Extract the structure of the graph
var = varargin{1};
if iscell(var)
% graph is stored as a cell array : first cell is nodes, second one is
% edges, and third one is faces
n = var{1};
if length(var) > 2
f = var{3};
end
varargin(1) = [];
elseif isstruct(var)
% graph is stored as a structure, with fields 'nodes', 'edges', and
% eventually 'faces'.
n = var.nodes;
if isfield(var, 'faces')
f = var.faces;
end
varargin(1) = [];
else
% graph is stored as set of variables: nodes, edges, and eventually
% faces
n = varargin{1};
% extract faces input argument
if length(varargin) > 2 && ~ischar(varargin{3})
f = varargin{3};
varargin(1:3) = [];
else
f = varargin{2};
varargin(1:2) = [];
end
end
% extract drawing style
if ~isempty(varargin)
faceColor = varargin{1};
end
% process special case of 'none' option, that can be used in a call from
% the drawGraph function
if strcmp(faceColor, 'none')
return;
end
%% Main drawing processing
% setup hold to display several faces
hold on;
if size(n, 2) == 3
% use a zbuffer to avoid display pbms.
set(gcf, 'renderer', 'zbuffer');
end
if iscell(f)
% each face is contained in a cell.
for fi = 1:length(f)
hf(fi) = patch('Faces', f{fi}, 'Vertices', n, 'FaceColor', faceColor, 'EdgeColor', 'none'); %#ok<AGROW>
end
else
% process faces as a NF-by-P array. NF i the number of faces,
% and all faces have the same number P of vertices (nodes).
hf = patch('Faces', f, 'Vertices', n, 'FaceColor', faceColor, 'EdgeColor', 'none');
end
%% format output arguments
if nargout == 1
varargout{1} = hf;
end
|
