GCPnts_UniformDeflection.hxx File Reference

#include <StdFail_NotDone.hxx>
#include <NCollection_Sequence.hxx>
#include <gp_Pnt.hxx>

Data Structures
class	GCPnts_UniformDeflection
	Provides an algorithm to compute a distribution of points on a 'C2' continuous curve. The algorithm respects a criterion of maximum deflection between the curve and the polygon that results from the computed points. Note: This algorithm is relatively time consuming. A GCPnts_QuasiUniformDeflection algorithm is quicker; it can also work with non-'C2' continuous curves, but it generates more points in the distribution. More...