圆排列问题（Circular arrangement problem）.docVIP

圆排列问题（Circular arrangement problem） Information worth having It comes from the accumulation of learning There must be a problem Also please criticize the correct! Circular arrangement problem 1. Problem description Im going to give you a round C1 that varies in size C2 ... Now Im going to put these N circles into a rectangular box And you want to have a circle that is tangent to the bottom edge of the rectangle The round arrangement problem requires all rows from N circles 2. Algorithm design The solution to the circle problem is an arrangement tree Search the algorithm frame of the permutation tree according to the backtracking method Lets start with a is equal to [r1 r2 ... Rn is the radius of the N circle given The corresponding permutation tree consists of all the permutations of a = [1: n] CirclePerm (n) in the backward algorithm of rounding up the circle A) return the smallest circle length found When the initial The radius of the input N circle of array a The end of the calculation returns a circle of the optimal solution The Center is used to calculate the horizontal coordinates of the circle in the current arrangement Compute is used to calculate the length of the current circle The variable min is used to record the length of the current minimum circle. Array r represents the current round arrangement; Array x records the circle values of the circles in the current circle In the algorithm, the x-coordinate of the first circle in the current circle is 0 In the recursive algorithm, bracktrack When I n The algorithm searches for leaf nodes Get the new round plan The algorithm calls compute to calculate the length of the current circle Update the current best value in due time When I n The current extension node is in the i-1 layer of the aligned tree The algorithm selects the next circle to be arranged And compute the corresponding lower bound function At the node that satisfies the constraint of the lower bound The subtree search is recursively recursively