Method IsUniform

src/LNLib/Algorithm/KnotVectorUtils.cpp:278–322

}

bool LNLib::KnotVectorUtils::IsUniform(const std::vector<double>& knotVector)
{
	auto map = GetKnotMultiplicityMap(knotVector);
	if (map.empty())
	{
		return false;
	}
	std::vector<double> knots;
	for (auto it = map.begin(); it != map.end(); ++it)
	{
		double key = it->first;
		knots.emplace_back(key);
	}
	std::sort(knots.begin(), knots.end());
	if (map[knots[0]] != map[knots[knots.size() - 1]])
	{
		return false;
	}
	double standard = knots[1] - knots[0];
	for (int i = 1; i < knots.size() - 1; i++)
	{
		double current = knots[i];
		double next = knots[i + 1];

		double gap = next - current;
		if (!MathUtils::IsAlmostEqualTo(gap, standard))
		{
			return false;
		}
		int currentCounts = map[current];
		int nextCounts = map[next];
		if (currentCounts != nextCounts)
		{
			if (i + 1 == knots.size() - 1)
			{
				continue;
			}
			else
			{
				return false;
			}
		}
	}
	return true;
}