To quickly discover these locations, the packer uses a sophisticated

41　　 /// data structure that stores the upper silhouette of the packing area. When

42　　 /// a new rectangle needs to be added, only the silouette edges need to be

43　　 /// analyzed to find the position where the rectangle would achieve the lowest

44　　 /// placement possible in the packing area.- To quickly discover these locations, the packer uses a sophisticated

41　　　///　　 data structure that stores the upper silhouette of the packing area. When

42　　　///　　 a new rectangle needs to be added, only the silouette edges need to be

43　　　///　　 analyzed to find the position where the rectangle would achieve the lowest

44　　　///　　 placement possible in the packing area.