#include <math.h>
#include <stdlib.h>
#include "MEM_guardedalloc.h"
#include "BLI_boxpack_2d.h"
#include "BLI_listbase.h"
#include "BLI_utildefines.h"
#include "BLI_sort.h"
#include "BLI_strict_flags.h"

Classes
struct	BoxVert

struct	VertSortContext

Macros
#define	qsort_r BLI_qsort_r

#define	USE_MERGE

#define	USE_FREE_STRIP

#define	USE_PACK_BIAS

#define	EPSILON 0.0000001f

#define	EPSILON_MERGE 0.00001f

#define	EPSILON_BIAS 0.000001f

#define	BLF 1

#define	TRF 2

#define	TLF 4

#define	BRF 8

#define	CORNERFLAGS (BLF \| TRF \| TLF \| BRF)

#define	BL 0

#define	TR 1

#define	TL 2

#define	BR 3

#define	A (vert->trb->v[TL])

#define	B (vert->tlb->v[TR])

#define	MASK (BLF \| BRF)

#define	A (vert->blb->v[BR])

#define	B (vert->brb->v[BL])

#define	MASK (TRF \| TLF)

#define	A (vert->blb->v[TL])

#define	B (vert->tlb->v[BL])

#define	MASK (TRF \| BRF)

#define	A (vert->brb->v[TR])

#define	B (vert->trb->v[BR])

#define	MASK (TLF \| BLF)

Typedefs
typedef struct BoxVert	BoxVert

Functions
BLI_INLINE int	quad_flag (uint q)

static float	max_ff (const float a, const float b)

static void	vert_bias_update (BoxVert *v)

void	BLI_box_pack_2d (BoxPack boxarray, const uint len, const bool sort_boxes, float r_tot_x, float *r_tot_y)

void	BLI_box_pack_2d_fixedarea (ListBase boxes, int width, int height, ListBase packed)

Box Accessor Functions
static float	box_xmin_get (const BoxPack *box)

static float	box_xmax_get (const BoxPack *box)

static float	box_ymin_get (const BoxPack *box)

static float	box_ymax_get (const BoxPack *box)

Box Placement
BLI_INLINE void	box_v34x_update (BoxPack *box)

BLI_INLINE void	box_v34y_update (BoxPack *box)

static void	box_xmin_set (BoxPack *box, const float f)

static void	box_xmax_set (BoxPack *box, const float f)

static void	box_ymin_set (BoxPack *box, const float f)

static void	box_ymax_set (BoxPack *box, const float f)

Box Utils
static float	box_area (const BoxPack *box)

static bool	box_isect (const BoxPack box_a, const BoxPack box_b)

Box/Vert Sorting
static int	box_areasort (const void p1, const void p2)

static int	vertex_sort (const void p1, const void p2, void *vs_ctx_p)

Macro Definition Documentation

◆ A [1/4]

#define A (vert->trb->v[TL])

Referenced by bake_differentials(), BLI_box_pack_2d(), BLI_ewa_filter(), bsdf_hair_huang_eval_trrt(), btDoSimplex2(), btDoSimplex3(), btDoSimplex4(), slim::build_linear_system(), Freestyle::ViewEdgeXBuilder::BuildSmoothFEdge(), Freestyle::GridHelpers::closestPointToSegment(), GivensRotation::columnRotation(), Freestyle::ViewMapBuilder::computeCusps(), Freestyle::ViewMapBuilder::ComputeRayCastingVisibility(), libmv::ComputeTrackingEquation(), Freestyle::crossesProscenium(), dBoxBox2(), Freestyle::GeomUtils::distPointSegment(), libmv::EightPointSolver(), GivensRotation::fill(), btLemkeAlgorithm::findLexicographicMinimum(), Freestyle::ViewMapBuilder::FindOccludee(), Freestyle::findOccludee(), blender::ed::object::followpath_path_animate_exec(), libmv::FundamentalFrom7CorrespondencesLinear(), btLemkeAlgorithm::GaussJordanEliminationStep(), Freestyle::ViewMap::getClosestFEdge(), Freestyle::ViewMap::getClosestViewEdge(), blender::math::interpolate(), Freestyle::GeomUtils::intersect2dSeg2dArea(), libmv::MatrixColumn(), libmv::MatrixColumn(), libmv::MatrixColumn(), libmv::euclidean_resection::MatrixToConstraint(), md5_process_block(), libmv::MeanAndVarianceAlongRows(), libmv::Dogleg< Function, Jacobian, Solver >::minimize(), libmv::LevenbergMarquardt< Function, Jacobian, Solver >::minimize(), newPerlin(), Freestyle::Functions0D::Curvature2DAngleF0D::operator()(), Freestyle::Functions0D::VertexOrientation2DF0D::operator()(), Freestyle::Functions0D::VertexOrientation3DF0D::operator()(), GivensRotation::operator*(), polarDecomposition(), blender::ed::greasepencil::primitive_calulate_curve_positions(), GivensRotation::rowRotation(), libmv::SelectKeyframesBasedOnGRICAndVariance(), SIM_hair_volume_solve_divergence(), singularValueDecomposition(), btLemkeAlgorithm::solve(), solve_least_squares(), libmv::SolveCubicPolynomial(), btLemkeSolver::solveMLCP(), btSolveProjectedGaussSeidel::solveMLCP(), SolveP3(), KDL::svd_eigen_HH(), and Freestyle::StrokeTesselator::Tesselate().

◆ A [2/4]

#define A (vert->blb->v[BR])

◆ A [3/4]

#define A (vert->blb->v[TL])

◆ A [4/4]

#define A (vert->brb->v[TR])

◆ B [1/4]

#define B (vert->tlb->v[TR])

Referenced by BLI_box_pack_2d().

◆ B [2/4]

#define B (vert->brb->v[BL])

◆ B [3/4]

#define B (vert->tlb->v[BL])

◆ B [4/4]

#define B (vert->trb->v[BR])

◆ BL

#define BL 0

Definition at line 83 of file boxpack_2d.c.

Referenced by BLI_box_pack_2d(), box_v34x_update(), box_v34y_update(), box_xmax_set(), box_xmin_get(), box_xmin_set(), box_ymax_set(), box_ymin_get(), and box_ymin_set().

◆ BLF

#define BLF 1

Definition at line 71 of file boxpack_2d.c.

Referenced by BLI_box_pack_2d().

◆ BR

#define BR 3

Definition at line 86 of file boxpack_2d.c.

Referenced by BKE_idtype_idcode_to_index(), BKE_idtype_idfilter_to_index(), BLI_box_pack_2d(), box_v34x_update(), and box_v34y_update().

◆ BRF

#define BRF 8

Definition at line 74 of file boxpack_2d.c.

Referenced by BLI_box_pack_2d().

◆ CORNERFLAGS

#define CORNERFLAGS (BLF | TRF | TLF | BRF)

Definition at line 75 of file boxpack_2d.c.

Referenced by BLI_box_pack_2d().

◆ EPSILON

#define EPSILON 0.0000001f

Definition at line 66 of file boxpack_2d.c.

Referenced by box_isect().

◆ EPSILON_BIAS

#define EPSILON_BIAS 0.000001f

Definition at line 69 of file boxpack_2d.c.

Referenced by vert_bias_update().

◆ EPSILON_MERGE

#define EPSILON_MERGE 0.00001f

Definition at line 67 of file boxpack_2d.c.

Referenced by BLI_box_pack_2d().

◆ MASK [1/4]

#define MASK (BLF | BRF)

Referenced by nanovdb::InternalNode< ChildT, Log2Dim >::CoordToOffset(), nanovdb::LeafNode< BuildT, Log2Dim >::CoordToOffset(), and nanovdb::CachedReadAccessor< BuildT >::insert().

◆ MASK [2/4]

#define MASK (TRF | TLF)

◆ MASK [3/4]

#define MASK (TRF | BRF)

◆ MASK [4/4]

#define MASK (TLF | BLF)

◆ qsort_r

#define qsort_r BLI_qsort_r

Definition at line 19 of file boxpack_2d.c.

Referenced by BLI_box_pack_2d().

◆ TL

#define TL 2

Definition at line 85 of file boxpack_2d.c.

Referenced by BLI_box_pack_2d(), box_v34x_update(), and box_v34y_update().

◆ TLF

#define TLF 4

Definition at line 73 of file boxpack_2d.c.

Referenced by BLI_box_pack_2d().

◆ TR

#define TR 1

Definition at line 84 of file boxpack_2d.c.

Referenced by BLI_box_pack_2d(), box_v34x_update(), box_v34y_update(), box_xmax_get(), box_xmax_set(), box_xmin_set(), box_ymax_get(), box_ymax_set(), box_ymin_set(), and bsdf_hair_huang_sample().

◆ TRF

#define TRF 2

Definition at line 72 of file boxpack_2d.c.

Referenced by BLI_box_pack_2d().

◆ USE_FREE_STRIP

#define USE_FREE_STRIP

Definition at line 30 of file boxpack_2d.c.

◆ USE_MERGE

#define USE_MERGE

Definition at line 28 of file boxpack_2d.c.

◆ USE_PACK_BIAS

#define USE_PACK_BIAS

Definition at line 32 of file boxpack_2d.c.

Typedef Documentation

◆ BoxVert

typedef struct BoxVert BoxVert

Function Documentation

◆ BLI_box_pack_2d()

void BLI_box_pack_2d	(	BoxPack *	boxarray,
		unsigned int	len,
		bool	sort_boxes,
		float *	r_tot_x,
		float *	r_tot_y )

Main box-packing function accessed from other functions This sets boxes x,y to positive values, sorting from 0,0 outwards. There is no limit to the space boxes may take, only that they will be packed tightly into the lower left hand corner (0,0)

Parameters

box_array	a pre-allocated array of boxes. only the 'box->x' and 'box->y' are set, 'box->w' and 'box->h' are used, 'box->index' is not used at all, the only reason its there is that the box array is sorted by area and programs need to be able to have some way of writing the boxes back to the original data.
len	the number of boxes in the array.
sort_boxes	Sort `box_array` before packing.
r_tot_x,r_tot_y	set so you can normalize the data.

Definition at line 271 of file boxpack_2d.c.

References A, B, BL, BoxVert::blb, BLF, BLI_assert, box_areasort(), VertSortContext::box_height, box_isect(), VertSortContext::box_width, box_xmax_get(), box_xmax_set(), box_xmin_get(), box_xmin_set(), box_ymax_get(), box_ymax_set(), box_ymin_get(), box_ymin_set(), BR, BoxVert::brb, BRF, CORNERFLAGS, ELEM, EPSILON_MERGE, fabsf, BoxVert::free, BoxPack::h, BoxVert::index, BoxVert::isect_cache, len, max_ff(), MEM_freeN(), MEM_mallocN, NULL, qsort_r, quad_flag(), TL, BoxVert::tlb, TLF, TR, BoxVert::trb, TRF, UNLIKELY, BoxVert::used, BoxPack::v, vert_bias_update(), VertSortContext::vertarray, vertex_sort(), BoxPack::w, BoxVert::x, and BoxVert::y.

Referenced by M_Geometry_box_pack_2d(), and blender::geometry::pack_island_box_pack_2d().

◆ BLI_box_pack_2d_fixedarea()

void BLI_box_pack_2d_fixedarea	(	struct ListBase *	boxes,
		int	width,
		int	height,
		struct ListBase *	packed )

Packs boxes into a fixed area.

Boxes and packed are linked lists containing structs that can be cast to FixedSizeBoxPack (i.e. contains a FixedSizeBoxPack as its first element). Boxes that were packed successfully are placed into *packed and removed from *boxes.

The algorithm is a simplified version of https://github.com/TeamHypersomnia/rectpack2D. Better ones could be used, but for the current use case (packing Image tiles into GPU textures) this is fine.

Note that packing efficiency depends on the order of the input boxes. Generally speaking, larger boxes should come first, though how exactly size is best defined (e.g. area, perimeter) depends on the particular application.

Definition at line 663 of file boxpack_2d.c.

References BLI_addhead(), BLI_addtail(), BLI_freelistN(), BLI_remlink(), FixedSizeBoxPack::h, LISTBASE_FOREACH, LISTBASE_FOREACH_MUTABLE, MEM_callocN, MEM_freeN(), NULL, FixedSizeBoxPack::w, FixedSizeBoxPack::x, and FixedSizeBoxPack::y.