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
|
## 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 b = isPointInPolygon(point, poly)
%ISPOINTINPOLYGON Test if a point is located inside a polygon.
%
% B = isPointInPolygon(POINT, POLYGON)
% Returns true if the point is located within the given polygon.
%
% This function is simply a wrapper for the function inpolygon, to avoid
% decomposition of point and polygon coordinates.
%
% Example
% pt1 = [30 20];
% pt2 = [30 5];
% poly = [10 10;50 10;50 50;10 50];
% isPointInPolygon([pt1;pt2], poly)
% ans =
% 1
% 0
%
% poly = [0 0; 10 0;10 10;0 10;NaN NaN;3 3;3 7;7 7;7 3];
% pts = [5 1;5 4];
% isPointInPolygon(pts, poly);
% ans =
% 1
% 0
%
%
% See also
% points2d, polygons2d, inpolygon, isPointInTriangle
%
% ------
% Author: David Legland
% E-mail: david.legland@inrae.fr
% Created: 2009-06-19, using Matlab 7.7.0.471 (R2008b)
% Copyright 2009-2023 INRA - Cepia Software Platform
% In case of a multiple polygon, decompose into a set of contours, and
% performs test for each contour
if iscell(poly) || any(isnan(poly(:)))
% transform as a cell array of simple polygons
polygons = splitPolygons(poly);
N = length(polygons);
Np = size(point, 1);
% compute orientation of polygon, and format to have Np*N matrix
areas = zeros(N, 1);
for i = 1:N
areas(i) = polygonArea(polygons{i});
end
ccw = areas > 0;
ccw = repmat(ccw', Np, 1);
% test if point inside each polygon
in = false(size(point, 1), N);
for i = 1:N
poly = polygons{i};
in(:, i) = inpolygon(point(:,1), point(:,2), poly(:,1), poly(:,2));
end
% count polygons containing point, weighted by polygon orientation
b = sum(in.*(ccw==1) - in.*(ccw==0), 2) > 0;
else
% standard test for simple polygons
b = inpolygon(point(:,1), point(:,2), poly(:,1), poly(:,2));
end
|