convert line to pixel coordinate

Hi,

if i have a path consist of six points , and i have obstacle, what i want is to put nodes in all the path to count the minimum distance between

the obstacle and the path

[darova]

I showed distance with green color on the image. Am i correct? Is that all you want?

[mohammed alany]

yes, i really want this

can you send the code please

[darova]

What about pdist2()?

[mohammed alany]

the problem i wanted all the coordinate of midpoints between each two nodes

Answer 1

[Image Analyst]

What if you just take the average of the initial, known points?

x = sort(rand(9, 1));
y = sort(rand(9, 1));
plot(x, y, '.-', 'Color', [247, 148, 20]/255, 'MarkerSize', 40);
grid on;
xlabel('X');
ylabel('Y');
xAve = (x(1:end-1) + x(2:end))/2;
yAve = (y(1:end-1) + y(2:end))/2;
hold on;
plot(xAve, yAve, '.', 'Color', [206, 24, 18]/255, 'MarkerSize', 40);
legend('Original Points', 'Mid Points', 'Location', 'north');

[mohammed alany]

dear Image Analyst,

many thanks for your reply,

but, is there any way to increase the number of Mid Points

like 10 mid pointes between each two was-points (x1,y1) and (x2,y2)

[Image Analyst]

You could use linspace() instead of just averaging. Try this:

x = sort(rand(9, 1));
y = sort(rand(9, 1));
% Now we have sample data and can begin.
numPoints = 2; % # points in between, not including the knot endpoints.
xAve = x(1);
yAve = y(1);
for k = 2 : length(y)
	inBetweenPoints = linspace(x(k-1), x(k), numPoints + 2); % 2 more to include the knots.
	xAve = [xAve, inBetweenPoints(2:end)];
	inBetweenPoints = linspace(y(k-1), y(k), numPoints + 2);
	yAve = [yAve, inBetweenPoints(2:end)];
end
plot(xAve, yAve, '.', 'Color', [206, 24, 18]/255, 'MarkerSize', 40);
hold on;
plot(x, y, '.-', 'Color', [247, 148, 20]/255, 'MarkerSize', 40);
grid on;
xlabel('X');
ylabel('Y');
legend('Mid Points', 'Original Points', 'Location', 'north');

You could also use interparc (File Exchange), or use splines (demo attached).

[mohammed alany]

many thanks Image Analyst

Answer 2

[Image Analyst]

Use bwdist().

[mohammed alany]

Many thanks for your replay,

but this is not binary images, can you show me how i can get all the mid points

between each two nodes as:

d = [1 1; 2 1; 2 2; 1 2]

midpoints = [1.25 1; 1.5 1;1.75 1; 2 1; 2 1.25; 2 1.5; 2 1.75; 2 2; 1.75 2; 1.5 2; 1.25 2; 1 2]

[darova]

I can show you.

[mohammed alany]

darova,

i hope this can help me

[darova]

What kind of nodes do you like more?

[mohammed alany]

red color is enough, can you send any help???

[darova]

You mean equal distance between nodes?

[Image Analyst]

If you don't have that image, then what do you have? A list of (x,y) coordinates of where the orange spots are?

[mohammed alany]

dear Image Analyst,

i have list of (x,y) coordinates, which is six orange spots as in figure,

i would like to finde midpoints along the path in order to calculate

the minimum distance between the all path with obstacles,

in my case if i have just 6 nodes, i will find just the distance between the orange spots and obstacles and this is dosn't mean the minimum distance between the obstacle and the path

[darova]

What about interparc()?

EXAMPLE