lpContour.cpp

#include "lpContour.h"

namespace lp
{
	
	void ContourOperations::MergeContour(Contour& mergedContour,
										 BoundingBox& mergedBBox,
										 Contour& contour1,
										 Contour& contour2,
										 BoundingBox& bbox1,
										 BoundingBox& bbox2,
										 const CellIndex cid1,
										 const CellIndex cid2,
										 const std::size_t gridSizeX)
	{
		// First step consists of building the bounding box resulting from the fusion
		// of the bounding boxes bbox1 and bbox2
		mergedBBox = MergeBoundingBoxes(bbox1, bbox2);

		// Create the associate matrix indicating where the cells are located
		// inside the bbox
		std::vector<bool> cellMatrix(mergedBBox.m_W*mergedBBox.m_H, false);

		// Fill the cell matrix with the cells from both contours
		{
			CellLists borderCells;

			// Fill with the cells of contour 1
			GenerateBorderCells(borderCells, contour1, cid1, gridSizeX);
			for(auto& cell: borderCells)
				cellMatrix[GridToBBox(cell, mergedBBox, gridSizeX)] = true;
			borderCells.clear();


			// Fill with the cells of contour 2
			GenerateBorderCells(borderCells, contour2, cid2, gridSizeX);
			for(auto& cell: borderCells)
				cellMatrix[GridToBBox(cell, mergedBBox, gridSizeX)] = true;
		}

		// Create the new contour
		CreateNewContour(mergedContour, GridToBBox(cid1, mergedBBox, gridSizeX), cellMatrix, mergedBBox.m_W, mergedBBox.m_H);
	}

	void ContourOperations::CreateNewContour(Contour& newContour,
											 const CellIndex cidx,
											 const std::vector<bool>& cellMatrix,
											 const std::size_t bboxWidth,
											 const std::size_t bboxHeight)
	{
		// The first move is always 1
		Push1(newContour);

		// Previous move
		short prevMove = 1;

		// Local pixel id
		CellIndex currIdx = cidx;

		// Table containing id neighbors
		long int neighbors[8];

		for(;;)
		{
		
			// Compute neighbor'ids
			EIGHTNeighborhood(neighbors, currIdx, bboxWidth, bboxHeight);
			
			if(prevMove == 1)
			{