Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

How to get 'bounding cube'? #36

Open
davidmcnabnz opened this issue Nov 27, 2022 · 0 comments
Open

How to get 'bounding cube'? #36

davidmcnabnz opened this issue Nov 27, 2022 · 0 comments

Comments

@davidmcnabnz
Copy link

Hi there,
Is there a straightforward way to determine position and size of the smallest possible rectangular prism which fully (but just barely) contains all of a shape's solid parts?

Ideally, this would be a method which returns two triads, ((x,y,z), (w,d,h)), where (x,y,z) is the absolute location of left lower bottom point of the containing prism, and (w,d,h) indicating width (x), depth (y) and height (h) of the prism.

One immediate use case is having an easy way to arrange as many copies of a shape as are possible (n x m) on a 3d printing bed, for printing as many copies of the shape as possible within a single print run.

Any thoughts?

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant