1 ## Copyright (C) 2003-2011 David Legland <david.legland@grignon.inra.fr>
2 ## Copyright (C) 2012 Adapted to Octave by Juan Pablo Carbajal <carbajal@ifi.uzh.ch>
3 ## All rights reserved.
5 ## Redistribution and use in source and binary forms, with or without
6 ## modification, are permitted provided that the following conditions are met:
8 ## 1 Redistributions of source code must retain the above copyright notice,
9 ## this list of conditions and the following disclaimer.
10 ## 2 Redistributions in binary form must reproduce the above copyright
11 ## notice, this list of conditions and the following disclaimer in the
12 ## documentation and/or other materials provided with the distribution.
14 ## THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS ''AS IS''
15 ## AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
16 ## IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
17 ## ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE FOR
18 ## ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
19 ## DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
20 ## SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
21 ## CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
22 ## OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
23 ## OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
25 ## The views and conclusions contained in the software and documentation are
26 ## those of the authors and should not be interpreted as representing official
27 ## policies, either expressed or implied, of the copyright holders.
30 ## @deftypefn {Function File} {@var{polygons} = } splitPolygons (@var{polygon})
31 ## Convert a NaN separated polygon list to a cell array of polygons.
33 ## @var{polygon} is a N-by-2 array of points, with possibly couples of NaN values.
34 ## The functions separates each component separated by NaN values, and
35 ## returns a cell array of polygons.
37 ## @seealso{polygons2d}
39 function polygons = splitPolygons(polygon)
42 # case of a cell array
45 elseif sum(isnan(polygon(:)))==0
46 # single polygon -> no break
50 # find indices of NaN couples
51 inds = find(sum(isnan(polygon), 2)>0);
55 polygons = cell(N, 1);
57 # iterate over NaN-separated regions to create new polygon
58 inds = [0;inds;size(polygon, 1)+1];
60 polygons{i} = polygon((inds(i)+1):(inds(i+1)-1), :);