/// <summary>
/// Greedy algorithm.
/// </summary>
/// <param name="_modules">List of modules that represent the images that need to be inserted into the sprite.</param>
/// <returns>Near optimal placement.</returns>
public static Placement Greedy(List <Module> _modules)
{
//Empty O-Tree code.
OTree oTree = new OTree();
OT finalOT = null;
//Empty list of modules.
List <Module> moduleList = new List <Module>();
//For each module which needs to be inserted.
foreach (Module module in _modules)
{
OTree bestOTree = null;
//Add module to the list of already packed modules.
moduleList.Add(module);
//Set the minimum perimeter of the placement to high.
int minPerimeter = Int32.MaxValue;
//Try all insertation point.
foreach (int insertationPoint in oTree.InsertationPoints())
{
OTree ot = oTree.Copy();
ot.Insert(module.Name, insertationPoint);
OT oT = new OT(ot, moduleList);
Placement pm = oT.Placement;
//Choose the one with the minimum perimeter.
if (pm.Perimeter < minPerimeter)
{
finalOT = oT;
bestOTree = ot;
minPerimeter = pm.Perimeter;
}
}
oTree = bestOTree;
}
return(finalOT.Placement);
}
/// <summary>
/// Greedy algorithm.
/// </summary>
/// <param name="_modules">List of modules that represent the images that need to be inserted into the sprite.</param>
/// <returns>Near optimal placement.</returns>
public static Placement Greedy(List<Module> _modules)
{
//Empty O-Tree code.
OTree oTree = new OTree();
OT finalOT = null;
//Empty list of modules.
List<Module> moduleList = new List<Module>();
//For each module which needs to be inserted.
foreach (Module module in _modules)
{
OTree bestOTree = null;
//Add module to the list of already packed modules.
moduleList.Add(module);
//Set the minimum perimeter of the placement to high.
int minPerimeter = Int32.MaxValue;
//Try all insertation point.
foreach (int insertationPoint in oTree.InsertationPoints())
{
OTree ot = oTree.Copy();
ot.Insert(module.Name, insertationPoint);
OT oT = new OT(ot, moduleList);
Placement pm = oT.Placement;
//Choose the one with the minimum perimeter.
if (pm.Perimeter < minPerimeter)
{
finalOT = oT;
bestOTree = ot;
minPerimeter = pm.Perimeter;
}
}
oTree = bestOTree;
}
return finalOT.Placement;
}