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
Comments
Post a Comment