1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
|
/**
*
* This file is part of Tulip (https://tulip.labri.fr)
*
* Authors: David Auber and the Tulip development Team
* from LaBRI, University of Bordeaux
*
* Tulip is free software; you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License
* as published by the Free Software Foundation, either version 3
* of the License, or (at your option) any later version.
*
* Tulip is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
* See the GNU General Public License for more details.
*
*/
#ifndef RECTANGLEPACKINGFONCTIONS_H
#define RECTANGLEPACKINGFONCTIONS_H
#include <vector>
#include <tulip/PluginProgress.h>
#include "RectanglePacking.h"
/**
*This function is used for packing rectangles. It is used when we want to
*reduce the complexity restricting the number of rectangles packed in an
*optimal way.
*@param v a vector including the rectangles to pack.
*@param quality give the complexity of the algorithm.
*@param progress pointer on an instance of the PluginProgress class.
*@return true if the computation has not stopped due to the PluginProgress.
*/
bool RectanglePackingLimitRectangles(std::vector<tlp::Rectangle<float>> &v, const char *quality,
tlp::PluginProgress *progress);
/**
*This function is used for packing rectangles. It is used when we want to
*reduce the complexity restricting the number of tested positions for each
*rectangle to pack.
*@param v a vector including the rectangles to pack.
*@param quality give the complexity of the algorithm.
*@param progress pointer on an instance of the PluginProgress class.
*@return true if the computation has not stopped due to the PluginProgress.
*/
bool RectanglePackingLimitPositions(std::vector<tlp::Rectangle<float>> &v, const char *quality,
tlp::PluginProgress *progress);
#endif
|
