Mercurial > hg > octave-nkf
view scripts/geometry/inpolygon.m @ 14868:5d3a684236b0
maint: Use Octave coding conventions for cuddling parentheses in scripts directory
* lin2mu.m, loadaudio.m, wavread.m, accumarray.m, bicubic.m, celldisp.m,
colon.m, cplxpair.m, dblquad.m, divergence.m, genvarname.m, gradient.m,
int2str.m, interp1.m, interp1q.m, interp2.m, interpn.m, loadobj.m, nthargout.m,
__isequal__.m, __splinen__.m, quadgk.m, quadl.m, quadv.m, rat.m, rot90.m,
rotdim.m, saveobj.m, subsindex.m, triplequad.m, delaunay3.m, griddata.m,
inpolygon.m, tsearchn.m, voronoi.m, get_first_help_sentence.m, which.m,
gray2ind.m, pink.m, dlmwrite.m, strread.m, textread.m, textscan.m, housh.m,
ishermitian.m, issymmetric.m, krylov.m, logm.m, null.m, rref.m,
compare_versions.m, copyfile.m, dump_prefs.m, edit.m, fileparts.m,
getappdata.m, isappdata.m, movefile.m, orderfields.m, parseparams.m,
__xzip__.m, rmappdata.m, setappdata.m, swapbytes.m, unpack.m, ver.m, fminbnd.m,
fminunc.m, fsolve.m, glpk.m, lsqnonneg.m, qp.m, sqp.m, configure_make.m,
copy_files.m, describe.m, get_description.m, get_forge_pkg.m, install.m,
installed_packages.m, is_architecture_dependent.m, load_package_dirs.m,
print_package_description.m, rebuild.m, repackage.m, save_order.m, shell.m,
allchild.m, ancestor.m, area.m, axes.m, axis.m, clabel.m, close.m, colorbar.m,
comet.m, comet3.m, contour.m, cylinder.m, ezmesh.m, ezsurf.m, findobj.m,
fplot.m, hist.m, isocolors.m, isonormals.m, isosurface.m, isprop.m, legend.m,
mesh.m, meshz.m, pareto.m, pcolor.m, peaks.m, plot3.m, plotmatrix.m, plotyy.m,
polar.m, print.m, __add_datasource__.m, __add_default_menu__.m,
__axes_limits__.m, __bar__.m, __clabel__.m, __contour__.m, __errcomm__.m,
__errplot__.m, __ezplot__.m, __file_filter__.m, __fltk_print__.m,
__ghostscript__.m, __gnuplot_print__.m, __go_draw_axes__.m,
__go_draw_figure__.m, __interp_cube__.m, __marching_cube__.m, __patch__.m,
__pie__.m, __plt__.m, __print_parse_opts__.m, __quiver__.m, __scatter__.m,
__stem__.m, __tight_eps_bbox__.m, __uigetdir_fltk__.m, __uigetfile_fltk__.m,
__uiputfile_fltk__.m, quiver.m, quiver3.m, rectangle.m, refreshdata.m,
ribbon.m, scatter.m, semilogy.m, shading.m, slice.m, subplot.m, surface.m,
surfl.m, surfnorm.m, text.m, uigetfile.m, uiputfile.m, whitebg.m, deconv.m,
mkpp.m, pchip.m, polyaffine.m, polyder.m, polygcd.m, polyout.m, polyval.m,
ppint.m, ppjumps.m, ppval.m, residue.m, roots.m, spline.m, splinefit.m,
addpref.m, getpref.m, setpref.m, ismember.m, setxor.m, arch_fit.m, arch_rnd.m,
arch_test.m, autoreg_matrix.m, diffpara.m, fftconv.m, filter2.m, hanning.m,
hurst.m, periodogram.m, triangle_sw.m, sinc.m, spectral_xdf.m, spencer.m,
stft.m, synthesis.m, unwrap.m, yulewalker.m, bicgstab.m, gmres.m, pcg.m, pcr.m,
__sprand_impl__.m, speye.m, spfun.m, sprandn.m, spstats.m, svds.m,
treelayout.m, treeplot.m, bessel.m, factor.m, legendre.m, perms.m, primes.m,
magic.m, toeplitz.m, corr.m, cov.m, mean.m, median.m, mode.m, qqplot.m,
quantile.m, ranks.m, zscore.m, logistic_regression_likelihood.m,
bartlett_test.m, chisquare_test_homogeneity.m, chisquare_test_independence.m,
kolmogorov_smirnov_test.m, run_test.m, u_test.m, wilcoxon_test.m, z_test.m,
z_test_2.m, bin2dec.m, dec2base.m, mat2str.m, strcat.m, strchr.m, strjust.m,
strtok.m, substr.m, untabify.m, assert.m, demo.m, example.m, fail.m, speed.m,
test.m, now.m: Use Octave coding conventions for cuddling parentheses in
scripts directory.
author | Rik <octave@nomad.inbox5.com> |
---|---|
date | Tue, 17 Jul 2012 07:08:39 -0700 |
parents | 11949c9795a0 |
children | f4c8c66faf34 |
line wrap: on
line source
## Copyright (C) 2006-2012 Frederick (Rick) A Niles ## and S�ren Hauberg ## ## This file is part of Octave. ## ## Octave is free software; you can redistribute it and/or modify it ## under the terms of the GNU General Public License as published by ## the Free Software Foundation; either version 3 of the License, or (at ## your option) any later version. ## ## Octave is distributed in the hope that it will be useful, but ## WITHOUT ANY WARRANTY; without even the implied warranty of ## MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU ## General Public License for more details. ## ## You should have received a copy of the GNU General Public License ## along with Octave; see the file COPYING. If not, see ## <http://www.gnu.org/licenses/>. ## -*- texinfo -*- ## @deftypefn {Function File} {[@var{in}, @var{on}] =} inpolygon (@var{x}, @var{y}, @var{xv}, @var{yv}) ## ## For a polygon defined by vertex points @code{(@var{xv}, @var{yv})}, determine ## if the points @code{(@var{x}, @var{y})} are inside or outside the polygon. ## The variables @var{x}, @var{y}, must have the same dimension. The optional ## output @var{on} gives the points that are on the polygon. ## ## @end deftypefn ## Author: Frederick (Rick) A Niles <niles@rickniles.com> ## Created: 14 November 2006 ## Vectorized by S�ren Hauberg <soren@hauberg.org> ## The method for determining if a point is in in a polygon is based on ## the algorithm shown on ## http://local.wasp.uwa.edu.au/~pbourke/geometry/insidepoly/ and is ## credited to Randolph Franklin. function [in, on] = inpolygon (x, y, xv, yv) if (nargin != 4) print_usage (); endif if (! (isreal (x) && isreal (y) && ismatrix (y) && ismatrix (y) && size_equal (x, y))) error ("inpolygon: first two arguments must be real matrices of same size"); elseif (! (isreal (xv) && isreal (yv) && isvector (xv) && isvector (yv) && size_equal (xv, yv))) error ("inpolygon: last two arguments must be real vectors of same size"); endif npol = length (xv); do_boundary = (nargout >= 2); in = zeros (size (x), "logical"); if (do_boundary) on = zeros (size (x), "logical"); endif j = npol; for i = 1 : npol delta_xv = xv(j) - xv(i); delta_yv = yv(j) - yv(i); ## distance = [distance from (x,y) to edge] * length(edge) distance = delta_xv .* (y - yv(i)) - (x - xv(i)) .* delta_yv; ## ## is y between the y-values of edge i,j ## AND (x,y) on the left of the edge ? idx1 = (((yv(i) <= y & y < yv(j)) | (yv(j) <= y & y < yv(i))) & 0 < distance.*delta_yv); in (idx1) = !in (idx1); ## Check if (x,y) are actually on the boundary of the polygon. if (do_boundary) idx2 = (((yv(i) <= y & y <= yv(j)) | (yv(j) <= y & y <= yv(i))) & ((xv(i) <= x & x <= xv(j)) | (xv(j) <= x & x <= xv(i))) & (0 == distance | !delta_xv)); on (idx2) = true; endif j = i; endfor endfunction %!demo %! xv = [ 0.05840, 0.48375, 0.69356, 1.47478, 1.32158, ... %! 1.94545, 2.16477, 1.87639, 1.18218, 0.27615, ... %! 0.05840 ]; %! yv = [ 0.60628, 0.04728, 0.50000, 0.50000, 0.02015, ... %! 0.18161, 0.78850, 1.13589, 1.33781, 1.04650, ... %! 0.60628 ]; %! xa = [0:0.1:2.3]; %! ya = [0:0.1:1.4]; %! [x,y] = meshgrid (xa, ya); %! [in,on] = inpolygon (x, y, xv, yv); %! inside = in & !on; %! %! clf; %! plot (xv, yv); %! hold on; %! plot (x(inside), y(inside), "@g") %! plot (x(!in), y(!in), "@m"); %! plot (x(on), y(on), "@b"); %! hold off; %! disp ("Green points are inside polygon, magenta are outside,"); %! disp ("and blue are on boundary."); %!demo %! xv = [ 0.05840, 0.48375, 0.69356, 1.47478, 1.32158, ... %! 1.94545, 2.16477, 1.87639, 1.18218, 0.27615, ... %! 0.05840, 0.73295, 1.28913, 1.74221, 1.16023, ... %! 0.73295, 0.05840 ]; %! yv = [ 0.60628, 0.04728, 0.50000, 0.50000, 0.02015, ... %! 0.18161, 0.78850, 1.13589, 1.33781, 1.04650, ... %! 0.60628, 0.82096, 0.67155, 0.96114, 1.14833, ... %! 0.82096, 0.60628]; %! xa = [0:0.1:2.3]; %! ya = [0:0.1:1.4]; %! [x,y] = meshgrid (xa, ya); %! [in,on] = inpolygon (x, y, xv, yv); %! inside = in & !on; %! %! clf; %! plot (xv, yv); %! hold on; %! plot (x(inside), y(inside), "@g"); %! plot (x(!in), y(!in), "@m"); %! plot (x(on), y(on), "@b"); %! hold off; %! disp ("Green points are inside polygon, magenta are outside,"); %! disp ("and blue are on boundary."); %!test %! [in, on] = inpolygon ([1, 0], [1, 0], [-1, -1, 1, 1], [-1, 1, 1, -1]); %! assert (in, [false, true]); %! assert (on, [true, false]); %% Test input validation %!error inpolygon () %!error inpolygon (1, 2) %!error inpolygon (1, 2, 3) %!error inpolygon (1, [1,2], [3, 4], [5, 6]) %!error inpolygon ([1,2], [3, 4], [5, 6], 1)