Method GetInsertedKnotElements

src/LNLib/Algorithm/KnotVectorUtils.cpp:205–265

}

std::vector<std::vector<double>> LNLib::KnotVectorUtils::GetInsertedKnotElements(const std::vector<std::vector<double>>& knotVectors)
{
	std::map<double, int> finalMap;
	for (int i = 0; i < knotVectors.size(); i++)
	{
		auto kv = knotVectors[i];
		std::map<double, int> map = GetKnotMultiplicityMap(kv);
		for (auto it = map.begin(); it != map.end(); ++it)
		{
			double key = it->first;
			int count = it->second;
			auto got = finalMap.find(key);
			if (got == finalMap.end())
			{
				finalMap.insert({ key, count });
			}
			else
			{
				int currentCount = got->second;
				if (currentCount < count)
				{
					finalMap[key] = count;
				}
			}
		}
	}

	std::vector<std::vector<double>> result;
	for (int i = 0; i < knotVectors.size(); i++)
	{
		auto kv = knotVectors[i];
		std::map<double, int> map = GetKnotMultiplicityMap(kv);

		std::vector<double> insertElements;
		for (auto it = finalMap.begin(); it != finalMap.end(); ++it)
		{
			double key = it->first;
			int count = it->second;

			auto got = map.find(key);
			if (got == map.end())
			{
				for (int j = 0; j < count; j++)
				{
					insertElements.emplace_back(key);
				}
			}
			else
			{
				int currentCount = got->second;
				int times = count - currentCount;
				for (int j = 0; j < times; j++)
				{
					insertElements.emplace_back(key);
				}
			}
		}
		result.emplace_back(insertElements);