Cody

Problem 1684. Identify Reachable Points

Given a vector of 2-D Points and a vector of 2-D Deltas create an array of all Locations that can be reached from the points using the Deltas. The provided Deltas are only positive but the points that can be reached may use Negative Deltas or Y-deltas for X moves, like moves of a Knight dxy [1 2].

Input: [Pts, dxy]

Output: Mxy

Example:

Pts [5 5; 7 9]
dxy [0 1]  % Multiple dxy are possible
Mxy =[4 5;5 4;5 6;6 5;6 9;7 8;7 10;8 9]

Related Challenges:

1) Minimum Sized Circle for N integer points with all unique distances

Solution Stats

57.14% Correct | 42.86% Incorrect
Last Solution submitted on Nov 04, 2019

Problem Recent Solvers16

Suggested Problems

More from this Author236

Problem Tags