Find the two most distant points - MATLAB Cody - MATLAB Central

Problem 51. Find the two most distant points

Difficulty:
(995)
Rate

Given a collection of points, return the indices of the rows that contain the two points most distant from one another. The input vector p has two columns corresponding to the x and y coordinates of each point. Return ix, the (sorted) pair of indices pointing to the remotest rows. There will always be one unique such pair of points.

So if

 p = [0 0]
     [1 0]
     [2 2]
     [0 1]

Then

 ix = [1 3]

That is, the two points p(1,:) and p(3,:) are farthest apart.

Solve

Solution Stats

57.18% Correct | 42.82% Incorrect
Last Solution submitted on Mar 10, 2025

Problem Comments

Solution Comments

Show comments
Who Deserves Your Praise? Discover the New Contribution Widget!
...
We are excited to announce another update to our Discussions area: the...

Problem Recent Solvers2880

Suggested Problems

More from this Author96

Problem Tags

distance

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!
Go to top of page