rectangles - Find the boundary of a polygon (or a staircase) c++ -


i'm doing 2d bin packing algorithm. goal put set of rectangle bin 1 one.

at each rectangle insertion, want update boundary between occupied area , free area. thus, i'm looking algorithm or way it. algorithm must able to:

1) find boundary after rectangle insertion (or find points of boundary).

2) travel clockwise points of boundary (imagine have points coordinates of boundary).

3) @ each corner (point) of boundary, algorithm can determinate if point on top left, top right, bottom left, bottom right

any appreciated. if need more information, ask , i'll provide can.

thank you

see these links:

http://en.wikipedia.org/wiki/bin_packing_problem

how 2d bin packing achieved programmatically?

https://math.stackexchange.com/questions/352575/2d-bin-packing-problem-with-opportunity-to-optimize-the-size-of-the-bin


Comments

Popular posts from this blog

linux - xterm copying to CLIPBOARD using copy-selection causes automatic updating of CLIPBOARD upon mouse selection -

qt - Errors in generated MOC files for QT5 from cmake -