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 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191
|
## 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 [nodes2, faces2] = clipConvexPolyhedronByPlane(nodes, faces, plane)
%CLIPCONVEXPOLYHEDRONBYPLANE Clip a convex polyhedron by a plane.
%
% [NODES2, FACES2] = clipConvexPolyhedronByPlane(NODES, FACES, PLANE)
%
% return the new (convex) polyhedron whose vertices are 'below' the
% specified plane, and with faces clipped accordingly. NODES2 contains
% clipped vertices and new created vertices, FACES2 contains references
% to NODES2 vertices.
%
% Example
% [N, F] = createCube;
% P = createPlane([.5 .5 .5], [1 1 1]);
% [N2, F2] = clipConvexPolyhedronByPlane(N, F, P);
% figure('color','w'); view(3); axis equal
% drawPolyhedron(N2, F2);
%
% [v, f] = createSoccerBall;
% p = createPlane([-.5 .5 -.5], [1 1 1]);
% [v2, f2] = clipConvexPolyhedronByPlane(v, f, p);
% figure('color','w'); view(3); axis equal
% drawMesh(v, f, 'faceColor', 'none');
% drawMesh(v2, f2);
%
% See also
% meshes3d, polyhedra, planes3d
%
% ------
% Author: David Legland
% E-mail: david.legland@inrae.fr
% Created: 2007-09-14, using Matlab 7.4.0.287 (R2007a)
% Copyright 2007-2023 INRA - BIA PV Nantes - MIAJ Jouy-en-Josas
%% Preprocessing
% used for identifying identical vertices
tol = 1e-10;
% if faces is a numeric array, convert it to cell array
if isnumeric(faces)
faces2 = cell(size(faces, 1), 1);
for f = 1:length(faces2)
faces2{f} = faces(f,:);
end
faces = faces2;
end
% find vertices below the plane
b = isBelowPlane(nodes, plane);
% initialize results
Nn = size(nodes, 1);
nodes2 = zeros(0, 3); % list of new nodes
faces2 = faces; % list of new faces. Start with initial list, and remove some of them
%% Main iteration on faces
% iterate on each face, and test if either:
% - all points below plane -> keep all face
% - all points up plane -> remove face
% - both -> clip the polygon
keep = true(length(faces), 1);
for f = 1:length(faces)
% current face
face = faces{f};
bf = b(face);
% face totally above plane
if sum(bf) == 0
keep(f) = false;
continue;
end
% face totally below plane
if sum(bf == 1) == length(bf)
continue;
end
% clip polygon formed by face
poly = nodes(face, :);
clipped = clipPolygonByPlane3d(poly, plane);
% identify indices of polygon vertices
inds = zeros(1, size(clipped, 1));
faceb = face(bf==1); % indices of vertices still in clipped face
[minDists, I] = minDistancePoints(nodes(faceb,:), clipped); %#ok<ASGLU>
for i = 1:length(I)
inds(I(i)) = faceb(i);
end
% indices of new points in clipped polygon
indNews = find(inds == 0);
if size(nodes2, 1) < 2
nodes2 = [nodes2; clipped(indNews, :)]; %#ok<AGROW>
inds(indNews(1)) = Nn + 1;
inds(indNews(2)) = Nn + 2;
faces2{f} = inds;
continue;
end
% distances from new vertices to already added vertices
[minDists, I] = minDistancePoints(clipped(indNews, :), nodes2);
% compute index of first vertex
if minDists(1) < tol
inds(indNews(1)) = Nn + I(1);
else
nodes2 = [nodes2; clipped(indNews(1), :)]; %#ok<AGROW>
inds(indNews(1)) = Nn + size(nodes2, 1);
end
% compute index of second vertex
if minDists(2) < tol
inds(indNews(2)) = Nn + I(2);
else
nodes2 = [nodes2; clipped(indNews(2), :)]; %#ok<AGROW>
inds(indNews(2)) = Nn + size(nodes2, 1);
end
% stores the modified face
faces2{f} = inds;
end
%% Postprocessing
% creates a new face formed by the added nodes
[sortedNodes, I] = angleSort3d(nodes2);
% compute normal vector of new face, and reverse order if face points in
% the opposite direction as plane normal
newFaceNormal = meshFaceNormals(sortedNodes, 1:length(sortedNodes));
if dot(newFaceNormal, planeNormal(plane)) < 0
I(2:end) = I(end:-1:2);
end
% compute vertex indices of new face
newFace = I' + Nn;
% remove faces outside plane and add the new face
faces2 = {faces2{keep}, newFace};
% remove clipped nodes, and add new nodes to list of nodes
N2 = size(nodes2, 1);
nodes2 = [nodes(b, :); nodes2];
% new nodes are inside half-space by definition
b = [b; ones(N2, 1)];
% create look up table between old indices and new indices
inds = zeros(size(nodes2, 1), 1);
indb = find(b);
for i = 1:length(indb)
inds(indb(i)) = i;
end
% update indices of faces
for f = 1:length(faces2)
face = faces2{f};
faces2{f} = inds(face)';
end
|