So, let's suppose we're in a 3D space with two points (corners) as the boundaries.
Now, we already know how we can get the easiest path in the 3D space. The problem I faced is how can we get a curve path (Points) that'll connect the both corners while spreading itself (line/path) acquring the most volume in the space.
Let's say we have a function f(A)
in which A is the number of points (input) and returns a array of size A consisting of the points which can acquire the most volume in the space in the mean time that can join the starting point and ending point as of a smooth curve (Spline let's say for now)
Suppose we have starting point [0,0,0] and [2,2,2] as ending point. When we pass 1 as A
for f(A)
it'll return us [1, 1/2, 0]
as it'll create a curve in the mean time joining both points and acquiring the most area. Resulting in similar to following point