You are given a 2D plane that contains an unknown set of points. The only way to get information about these points is through an external function:
def exist(min_x: int, min_y: int, length: int) -> bool:
# Returns True if the given rectangular area contains at least one point,
# otherwise returns False.
# The rectangle is defined by its bottom-left corner (min_x, min_y)
# and extends 'length' units in both the positive x and positive y directions.
Your task is to find the exact coordinates of every point on the plane.
There is no explicit input. You must query the environment using the exist function.
Return a list of all point coordinates found. Each point should be represented as a tuple of two integers (x, y).
How would your approach change if the search space is a rectangle with known width and height, instead of an unbounded square?