On Aug 7, 2014, at 4:26 PM, Barend Gehrels <barend@xs4all.nl> wrote:
Belcourt, Kenneth wrote On 7-8-2014 23:59:
I’m looking for an algorithm that will take a largish number (i.e. 10^5) 2d or 3d polygons (mostly parallel-pipeds, e.g. squares and boxes) and partition them into non-overlapping groups where each group contains some number of polygons that might abut along an edge or face, but not overlap. Each box can be represented by a collection of line segments so I thought geometry might have what I’m looking for but I didn’t see anything in a quick scan of the documentation.
Does this so called packing (layout) algorithm sound like something already in Boost, Geometry or other library? I have an implementation but what looking to see what other options exist.
No, this algorithm (or similar algorithms) does not exist in Boost.Geometry.
Okay, thanks Barend!