Thread Subject:

optimizing algorithm

i have matrix (MAP) which elements are the x and y coordinates of walls locations
the aim of the code is to check how many walls
when i run the code on big matrix, the bottleneck is at strmatch function
how to improve the code so it will be more faster?


if (Tx.Y ~= Rx.Y)
    % Let Rx > Tx
    if (Tx.Y > Rx.Y)
        [Tx, Rx] = SwapPoint ( Tx, Rx);
    end
    if (Tx.X == Rx.X)
        for Yi=Tx.Y + 1 : Rx.Y
            indx=strmatch([Tx.X Yi], MAP);
            if (~isempty(indx))
                WallsPass=[WallsPass; Tx.X, Yi];
                LossesPass=[LossesPass defaultWallLose];
            end
        end
    else
        m = (Tx.Y - Rx.Y)/(Tx.X - Rx.X);
        for Yi=Tx.Y + 1 : Rx.Y
            Xi = floor(Tx.X+0.5 + (Yi - Tx.Y - 0.5)/m);
            indx=strmatch([Xi Yi], MAP);
            if (~isempty(indx))
                WallsPass=[WallsPass; Xi, Yi];
                LossesPass=[LossesPass defaultWallLose];
            end
        end
    end
end

> i have matrix (MAP) which elements are the x and y coordinates of walls locations
> when i run the code on big matrix, the bottleneck is at strmatch function
strmatch is for finding strings, isn't it? So, why is it used for a matrix here? Or is it a cell-array? How are the coordinates stored in MAP?
Well, more information about MAP is needed. Do you need strings, or does it work with logical variables?


> the aim of the code is to check how many walls
How does this sentence end?