Cody

Problem 193. Smallest distance between a point and a rectangle

Given two points x and y placed at opposite corners of a rectangle, find the minimal euclidean distance between another point z and every point within this rectangle.

For example, the two points

     x = [-1,-1];
     y = [1,1];

define a square centered at the origin. The distance between the point

   z = [4,5];

and this square is

   d = 5;

(the closest point in the square is at [1,1])

The distance between the point z = [0,2] and this same square is d = 1 (closest point at [0,1])

The distance between the point z = [0,0] and this same square is d = 0 (inside the square)

Notes:

  • you can always assume that x < y (element-wise)
  • The function should work for points x,y,z in an arbitrary n-dimensional space (with n>1)

Solution Stats

43.9% Correct | 56.1% Incorrect
Last solution submitted on Jan 23, 2019

Problem Comments

Solution Comments

Recent Solvers49

Suggested Problems

More from this Author38

Tags

Discover MakerZone

MATLAB and Simulink resources for Arduino, LEGO, and Raspberry Pi

Learn more

Discover what MATLAB® can do for your career.

Opportunities for recent engineering grads.

Apply Today

MATLAB Academy

New to MATLAB?

Learn MATLAB today!