fwiw inscribed rectangles are a lot easier than squares
On Feb 23, 2:43 pm, David Rutten <[email protected]> wrote: > Hi Jonathon, > > there is no clear cut solution for this, unless your container shape > has some extremely well defined parameters, then perhaps you can > create a dedicated algorithm rather than a generic fitting algorithm. > > I've thought about minimum bounding rectangles in the past, and those > are pretty easy to find (in 2D) if your input shape only consists of > straight segments. Essentially you find a circumscribing box aligned > with every edge, then pick the smallest one. I have no good ideas for > inscribed boxes. > > -- > David Rutten > [email protected] > Robert McNeel & Associates > > On Feb 23, 2:25 pm, urbansurgery <[email protected]> wrote: > > > > > by way of clarification: it is not important that all four corners of > > the square touch the polygon, just that it is the largest square that > > can fit inside > > > On Feb 23, 1:11 pm, urbansurgery <[email protected]> wrote: > > > > Can anyone help or does anyone have a gut feeling where to start with > > > generating a maximum inscribed square routine? > > > > Lets say for simple starters that the square to be generated is world > > > oriented and the shape to be inscribed is a 4 sided irregular polygon > > > > ive tried about half a dozen different methods and i'm not convinced > > > that any of them could be declared 'maximum' > > > > thanks > > > > jonathon- Hide quoted text - > > - Show quoted text -
