Reference

rectanglePackingFonctions.cpp(3tulip)

NAME

rectanglePackingFonctions.cpp -

SYNOPSIS

#include 'rectanglePackingFonctions.h'
#include <stdlib.h>

Functions

vector< Rectangle< float > > & RectanglePackingLimitRectangles (vector< Rectangle< float > > &v, const char *quality, PluginProgress *progress)
vector< Rectangle< float > > & RectanglePackingLimitPositions (vector< Rectangle< float > > &v, const char *quality, PluginProgress *progress)

Function Documentation

vector<Rectangle<float> >& RectanglePackingLimitPositions (vector< Rectangle< float > > & v, const char * quality, 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.

Parameters:

v a vector including the rectangles to pack.
quality give the complexity of the algorithm.
progress pointer on an instance of the PluginProgress class.

Returns:

the vector v whose rectangles have had their co-ordinates changed.

vector<Rectangle<float> >& RectanglePackingLimitRectangles (vector< Rectangle< float > > & v, const char * quality, PluginProgress * progress) Authors: David Auber, Patrick Mary, Morgan Mathiaut from the LaBRI Visualization Team Email : [email protected] Last modification : 13/03/2009 This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version.

Author

Generated automatically by Doxygen for Tulip Plugins Library from the source code.