It looks like you're new here. If you want to get involved, click one of these buttons!

Given 2 solids an unknown distance apart, how would one go about filling the space between them with a certain number of identical solids?

Think of this as two fence posts on the corners of a property and the task is to add X number of additional posts between them WITHOUT KNOWING ANY DISTANCE MEASUREMENTS.

My primitive solution is to draw a line between the original posts, center to center on the XY plane and then use Divide to place evenly spaced points on that line to use as destinations for a copy using the Manipulator's 'r' capability to sweep across the line.

## Comments

There is no path curve. All you have are two solids.

The method I outlined uses a crutch to allow DIVIDE to do the heavy lifting. I'm looking for something that can do it without creating a phony element.

Does such a method exist? That's the question!

When prompted for the total distance pick two points. You only need 1 solid. You may need to align your UCS first.