LabVIEW
Image/Picture to to 2d Array Without Using PictureToPixmap
Or are you just talking about line interpolation between defined points? That seems trivial.
@altenbach wrote:Or are you just talking about line interpolation between defined points? That seems trivial.
Here's one possible solution for that. Modify as needed.
(this is just a quick a dirty draft. I am sure it can be improved).
Of course you would need to include the correct scaling between values and indices. My algorithm should be applied once the data is quantized to pixels.
Once you have a continuous outline, a flood fill is simple If you can make certain assumptions about the shape. Is that what you want?
@altenbach wrote:
What defines the "interior"? can you show a sketch of the final image? Do you just want the lines to be wider than 1 pixel?
your last post is exactly what i want.
in this sketch you can see the shape before and after filling it.
later on i used the point coordinates from the filled shape to draw the picture.
how exactly did you do the flood fill? without using picture functions i assume.
@re-fuse wrote:
how exactly did you do the flood fill?
There are plenty of flood fill algorithms discussed on the web (start here) but they require a definition of what is "inside" and "outside" In your case, the array border seems to be outside and you have two independent areas to fill. Is this always the case? You only have one array of points. How do you know when one curve ends and the other starts to prevent connecting them? The XY data in the VI you attached earlier is rather boring (just a rectangle), so it wouold be nice to have something with a bit more realistic data. Is the data always symmetric? Would it be sufficient to define the upper curve and just mirror it for the lower half?
re-fuse wrote:later on i used the point coordinates from the filled shape to draw the picture.
At the end you transform the 2D array into a picture. No need for coordinates and no drawing involved.
@re-fuse wrote:
that's why the floodfill algorithm didnt work cause i'd have to manually define where's inside/outside for each shape.
I thought that you know that the array edge is "outside", thus you can easily find all the "inside" areas. i.e. all pixels where you cross a border an odd number of times. OTOH, the outside seems to be contiguous, so why not anti-fill the ouside instead? (Start with an U8 array of ones, interpolate the edges and fill with twos, then fill the outside with zeroes. change to boolean array using "not equal zero" or similar).
@re-fuse wrote:
each shape is defined by a cubic bezier curves. in that beam-splitter example above i have 24x bezier curve, 12x for the upper arm and 1x for the lower arm ... and the last bezier curve ends where the first bezier curve starts so that the shape is complete.
You still need to define where one curve ends and the next curve starts, else my algorithm would connect the last point of one area with the first point of the next area and you get one extra line. that messes up the fill algorithm. I don't understand how your numbers add up (24x, 12x, 1x). How many points per curve are there?
@re-fuse wrote:
i've attached a VI with more realistic data.
The VI does not contain any data. You need to make the values default before saving and attaching. (Or just right-click the terminal of the control (once it contains the data!) and "create constant". Now delete everything but that constant, save VI under a new name and attach it here.
