@Kent1Cooper wrote:
....
If you want to find the smallest bounding box of something that's not rectangular, then you would need some way of deciding at what rotation to consider it. Or perhaps you could make a routine that would try it out at a series of different angles, and report back the smallest result, but that would be limited in its precision by the increment between those angles.
....
Reviving an old thread, but if someone finds this while looking for a smallest-rectangle-at-any-angle routine, that doesn't require adjusting the UCS as Bill Gilliss's routine above does, and works with any size selection set rather than one object, look at the second version of SmallestRectangle.lsp [the one that's an attachment, not the one in a code window that draws the orthogonal one], here.
sometime ago, and under a different employer I purchaced an active x component that I used in vba. I was also succesful in reading in the library into lisp properties, methods and events. It made matrix math a breaze.
check it out at http://www.bluebit.gr/
I think I did a post on it then on using it in lisp code.