[Octave-cvsupdate] SF.net SVN: octave:[5824] trunk/octave-forge/main/image/inst/poly2mask.m

[<ha...@us...>]

Revision: 5824
          http://octave.svn.sourceforge.net/octave/?rev=5824&view=rev
Author:   hauberg
Date:     2009-05-14 17:48:08 +0000 (Thu, 14 May 2009)

Log Message:
-----------
Remove a warning and add a bunch of spaces to the code

Modified Paths:
--------------
    trunk/octave-forge/main/image/inst/poly2mask.m

Modified: trunk/octave-forge/main/image/inst/poly2mask.m
===================================================================
--- trunk/octave-forge/main/image/inst/poly2mask.m	2009-05-14 17:19:06 UTC (rev 5823)
+++ trunk/octave-forge/main/image/inst/poly2mask.m	2009-05-14 17:48:08 UTC (rev 5824)
@@ -45,139 +45,137 @@
 
 ## Author:  Josep Mones i Teixidor <jm...@pu...>
 
-function BW = poly2mask(x, y, m, n)
-  if (nargin!=4)
-    usage("BW = poly2mask(x, y, m, n)");
+function BW = poly2mask (x, y, m, n)
+  if (nargin != 4)
+    print_usage ();
   endif
 
   ## check x and y
-  x=round(x(:)');
-  y=round(y(:)');
-  if(length(x)<3)
-    error("poly2mask: polygon must have at least 3 vertices.");
+  x = round (x (:).');
+  y = round (y (:).');
+  if (length (x) < 3)
+    error ("poly2mask: polygon must have at least 3 vertices.");
   endif
-  if(length(x)!=length(y))
-    error("poly2mask: length of x doesn't match length of y.");
+  if (length (x) != length (y))
+    error ("poly2mask: length of x doesn't match length of y.");
   endif
 
   ## create output matrix
-  uint8(0); ## This fails for octave < 2.1.58
-  BW=logical(zeros(m,n,"uint8"));
+  BW = false (m, n);
 
   ## close polygon if needed
-  if((x(1)!=x(length(x)))||(y(1)!=y(length(y))))
-    x=horzcat(x,x(1));
-    y=horzcat(y,y(1));
+  if ((x (1) != x (length (x))) || (y (1) != y (length (y))))
+    x = horzcat (x, x (1));
+    y = horzcat (y, y (1));
   endif
 
   ## build global edge table
-  ex=[x(1:length(x)-1);x(1,2:length(x))]; ## x values for each edge
-  ey=[y(1:length(y)-1);y(1,2:length(y))]; ## y values for each edge
-  idx=find(ey(1,:)!=ey(2,:));             ## eliminate horizontal edges
-  ex=ex(:,idx);
-  ey=ey(:,idx);
-  eminy=min(ey);                          ## minimum y for each edge
-  emaxy=max(ey);                          ## maximum y for each edge
-  t=ey==[eminy;eminy];                    ## values associated to miny
-  exminy=ex(:)(find(t));                  ## x values associated to min y
-  exmaxy=ex(:)(find(!t));                 ## x values associated to max y
-  emaxy=emaxy';                           ## we want them vertical now...
-  eminy=eminy';
-  m_inv=(exmaxy-exminy)./(emaxy-eminy);   ## calculate inverse slope
-  ge=[emaxy, eminy, exmaxy, m_inv];       ## build global edge table
-  ge=sortrows(ge,[1,3]);                  ## sort on eminy and exminy
+  ex = [x(1:length (x) - 1); x(1, 2:length (x))]; ## x values for each edge
+  ey = [y(1:length (y) - 1); y(1, 2:length (y))]; ## y values for each edge
+  idx = (ey (1, :) != ey (2, :));                 ## eliminate horizontal edges
+  ex = ex (:, idx);
+  ey = ey (:, idx);
+  eminy = min (ey);                               ## minimum y for each edge
+  emaxy = max (ey);                               ## maximum y for each edge
+  t = (ey == [eminy; eminy]);                     ## values associated to miny
+  exminy = ex (:) (t);                            ## x values associated to min y
+  exmaxy = ex (:) (!t);                           ## x values associated to max y
+  emaxy = emaxy.';                                ## we want them vertical now...
+  eminy = eminy.';
+  m_inv = (exmaxy - exminy)./(emaxy - eminy);     ## calculate inverse slope
+  ge = [emaxy, eminy, exmaxy, m_inv];             ## build global edge table
+  ge = sortrows (ge, [1, 3]);                     ## sort on eminy and exminy
 
   ## we add an extra dummy edge at the end just to avoid checking
   ## while indexing it
-  ge=[-Inf,-Inf,-Inf,-Inf;ge];
+  ge = [-Inf, -Inf, -Inf, -Inf; ge];
 
   ## initial parity is even (0)
-  parity=0;
+  parity = 0;
 
   ## init scan line set to bottom line
-  sl=ge(size(ge,1),1);
+  sl = ge (size (ge, 1), 1);
 
   ## init active edge table
   ## we use a loop because the table is sorted and edge list could be
   ## huge
-  ae=[];
-  gei=size(ge,1);
-  while sl==ge(gei,1)
-    ae=[ge(gei,2:4);ae];
-    gei-=1;
+  ae = [];
+  gei = size (ge, 1);
+  while (sl == ge (gei, 1))
+    ae = [ge(gei, 2:4); ae];
+    gei -= 1;
   endwhile
 
   ## calc minimum y to draw
-  miny=min(y);
-  if (miny<1)
-    miny=1;
+  miny = min (y);
+  if (miny < 1)
+    miny = 1;
   endif
 
-  while sl>=miny
+  while (sl >= miny)
     ## check vert clipping
-    if(sl<=m)
+    if (sl <= m)
       ## draw current scan line
       ## we have to round because 1/m is fractional
-      ie=round(reshape(ae(:,2),2,size(ae)/2));
+      ie = round (reshape (ae (:, 2), 2, size (ae, 1)/2));
 
       ## this discards left border of image (this differs from version at
       ## http://www.cs.rit.edu/~icss571/filling/ which discards right
       ## border) but keeps an exception when the point is a vertex.
-      ie(1,:)+=ie(1,:)!=ie(2,:);
+      ie (1, :) += (ie (1, :) != ie (2, :));
 
       ## we'll clip too, just in case m,n is not big enough
-      ie(1,find(ie(1,:)<1))=1;
-      ie(2,find(ie(2,:)>n))=n;
+      ie (1, (ie (1, :) < 1)) = 1;
+      ie (2, (ie (2, :) > n)) = n;
 
       ## we eliminate segments outside window
-      ie=ie(:,find(ie(1,:)<=n));
-      ie=ie(:,find(ie(2,:)>=1));
-      for i=1:columns(ie)
-	BW(sl,ie(1,i):ie(2,i))=true;
+      ie = ie (:, (ie (1, :) <= n));
+      ie = ie (:, (ie (2, :) >= 1));
+      for i = 1:columns (ie)
+	BW (sl, ie (1, i):ie (2, i)) = true;
       endfor
     endif
 
     ## decrement scan line
-    sl-=1;
+    sl -= 1;
 
     ## eliminate edges that eymax==sl
     ## this discards ymin border of image (this differs from version at
     ## http://www.cs.rit.edu/~icss571/filling/ which discards ymax).
-    ae=ae(find(ae(:,1)!=sl),:);
+    ae = ae ((ae (:, 1) != sl), :);
 
     ## update x (x1=x0-1/m)
-    ae(:,2)-=ae(:,3);
+    ae (:, 2) -= ae (:, 3);
 
     ## update ae with new values
-    while sl==ge(gei,1)
-      ae=vertcat(ae,ge(gei,2:4));
-      gei-=1;
+    while (sl == ge (gei, 1))
+      ae = vertcat (ae, ge (gei, 2:4));
+      gei -= 1;
     endwhile
 
     ## order the edges in ae by x value
-    if(rows(ae)>0)
-      ae=sortrows(ae,2);
+    if (rows (ae) > 0)
+      ae = sortrows (ae, 2);
     endif
   endwhile
 endfunction
 
-
+## This should create a filled octagon
 %!demo
-%! s=[0:pi/4:2*pi];
-%! x=cos(s)*90+101;
-%! y=sin(s)*90+101;
-%! bw=poly2mask(x,y,200,200);
-%! imshow(bw);
-%! %Creates a filled octagon
+%! s = [0:pi/4:2*pi];
+%! x = cos (s) * 90 + 101;
+%! y = sin (s) * 90 + 101;
+%! bw = poly2mask(x, y, 200, 200);
+%! imshow (bw);
 
+## This should create a 5-vertex star
 %!demo
-%! s=[0:2*pi/5:pi*4];
-%! s=s([1,3,5,2,4,6]);
-%! x=cos(s)*90+101;
-%! y=sin(s)*90+101;
-%! bw=poly2mask(x,y,200,200);
-%! imshow(bw);
-%! %Creates a 5-vertex star
+%! s = [0:2*pi/5:pi*4];
+%! s = s ([1, 3, 5, 2, 4, 6]);
+%! x = cos (s) * 90 + 101;
+%! y = sin (s) * 90 + 101;
+%! bw = poly2mask (x, y, 200, 200);
+%! imshow (bw);
 
 %!# Convex polygons
 


This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site.