Efficiency improvement for slicing point placements

A package implemented for floorplan optimization is discussed. It contains algorithms for finding optimal sliced rectangle dissections consistent with initial data structures such as point placements, partitioning trees, slicing trees, and floorplans. Among these point slicing achieves relatively high area utilization. Although the worst-case time complexity of the algorithm is polynomial in the number of rectangles (O(n⁶)), average case time and memory usage is high. A strategy to reduce these complexities while keeping a near-optimal solution likely is introduced. Also a selection of more wirable dissections among those with equal contour score is presented