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
|
## 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 = cutMeshByPlane(v, f, plane, varargin)
%CUTMESHBYPLANE Cut a mesh by a plane.
%
% [ABOVE, IN, BELOW] = cutMeshByPlane(MESH, PLANE)
% where MESH, ABOVE, IN, BELOW are structs with the fields vertices and
% faces, and PLANE is given as a row containing initial point and 2
% direction vectors. ABOVE, IN, BELOW contain the corresponding parts of
% the input mesh.
%
% [ABOVE_V, ABOVE_F, IN_V, IN_F, BELOW_V,BELOW_F] = ...
% cutMeshByPlane(V, F, PLANE) where V is a [NVx3] array containing
% coordinates and F is a [NFx3] array containing indices of vertices of
% the triangular faces.
%
% BELOW = cutMeshByPlane(V, F, PLANE, 'part', 'below') BELOW is a struct
% with the fields vertices and faces. Other options are:
% 'part' - 'above': Faces above the plane
% - 'in' : Faces in the plane
% - 'below': Faces below the plane
%
% [BELOW_V, BELOW_F] = cutMeshByPlane(MESH, PLANE, 'part', 'below') is
% possible, too.
%
% ------
% Authors: oqilipo, David Legland
% E-mail: david.legland@inrae.fr
% Created: 2017-07-09
% Copyright 2017-2023
narginchk(2,5)
nargoutchk(1,6)
%% Parse inputs
% If first argument is a struct
if nargin == 2 || nargin == 4
if ~isempty(varargin)
varargin = [{plane}, varargin(:)'];
end
plane = f;
[v, f] = parseMeshData(v);
end
p = inputParser;
addRequired(p,'plane',@isPlane)
validStrings = {'above','in','below'};
addParameter(p,'part','above',@(x) any(validatestring(x, validStrings)))
parse(p, plane, varargin{:});
part=p.Results.part;
%% Algorithm
% Logical index to the vertices below the plane
VBPl_LI = isBelowPlane(v, plane);
% Logical index to three vertices of each face
FBP_LI = VBPl_LI(f);
switch nargout
case {1, 2}
switch part
case 'above'
% Faces above the plane, all three vertices == 0 -> sum has to be 0
above = removeMeshFaces(v, f, ~(sum(FBP_LI, 2) == 0) );
case 'in'
% Faces in the plane, 1 or 2 vertices == 0 -> sum can be 1 or 2
inside = removeMeshFaces(v, f, ~((sum(FBP_LI, 2) > 0 & sum(FBP_LI, 2) < 3)));
case 'below'
% Faces below the plane, all three vertices == 1 -> sum has to be 3
below = removeMeshFaces(v, f, ~(sum(FBP_LI, 2) == 3) );
end
case {3, 6}
% Faces above the plane, all three vertices == 0 -> sum has to be 0
above = removeMeshFaces(v, f, ~(sum(FBP_LI, 2) == 0) );
% Faces in the plane, 1 or 2 vertices == 0 -> sum can be 1 or 2
inside = removeMeshFaces(v, f, ~((sum(FBP_LI, 2) > 0 & sum(FBP_LI, 2) < 3)));
% Faces below the plane, all three vertices == 1 -> sum has to be 3
below = removeMeshFaces(v, f, ~(sum(FBP_LI, 2) == 3) );
otherwise
error('Invalid number of output arguments')
end
%% Parse outputs
switch nargout
case 1
switch part
case 'above'
varargout{1}=above;
case 'in'
varargout{1}=inside;
case 'below'
varargout{1}=below;
end
case 2
switch part
case 'above'
varargout{1}=above.vertices;
varargout{2}=above.faces;
case 'in'
varargout{1}=inside.vertices;
varargout{2}=inside.faces;
case 'below'
varargout{1}=below.vertices;
varargout{2}=below.faces;
end
case 3
varargout{1}=above;
varargout{2}=inside;
varargout{3}=below;
case 6
varargout{1}=above.vertices;
varargout{2}=above.faces;
varargout{3}=inside.vertices;
varargout{4}=inside.faces;
varargout{5}=below.vertices;
varargout{6}=below.faces;
otherwise
error('Invalid number of output arguments')
end
end
|
