Bottom-Left Placement Theorem for Rectangle Packing

Details Bottom-Left Placement Theorem for Rectangle Packing Bottom-Left Placement Theorem for Rectangle Packing

2011-07-22

arxiv.org/abs/1107.4463v1

Computer Science

Discrete Mathematics

Scientific paper

This paper proves a bottom-left placement theorem for the rectangle packing problem, stating that if it is possible to orthogonally place n arbitrarily given rectangles into a rectangular container without overlapping, then we can achieve a feasible packing by successively placing a rectangle onto a bottom-left corner in the container. This theorem shows that even for the real-parameter rectangle packing problem, we can solve it after finite times of bottom-left placement actions. Based on this theorem, we might develop efficient heuristic algorithms for solving the rectangle packing problem.

Affiliated with

Also associated with

No associations

Rating

Bottom-Left Placement Theorem for Rectangle Packing does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Bottom-Left Placement Theorem for Rectangle Packing, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Bottom-Left Placement Theorem for Rectangle Packing will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-676198