Returns the number of elements currently in the DisjointSets data structure.

! \brief Computes statistics for the positional errors between a polyline and its simplification. Various statistics (mean

! \brief Performs Douglas-Peucker approximation (DP). The DP algorithm uses the RadialDistance (RD) routine O(n) as a prep

! \brief Performs a Douglas-Peucker approximation variant (DPn). This algorithm is a variation of the original implementat

! \brief Performs Lang approximation (LA). The LA routine defines a fixed size search-region. The first and last points of

! \brief Performs the nth point routine (NP). NP is an O(n) algorithm for polyline simplification. It keeps only the first

! \brief Performs Opheim approximation (OP). The O(n) OP routine is very similar to the Reumann-Witkam (RW) routine, and c

! \brief Performs Reumann-Witkam approximation (RW). The O(n) RW routine uses a point-to-line (perpendicular) distance tol

---------------------------------------------------------------------------

---------------------------------------------------------------------------

---------------------------------------------------------------------------

---------------------------------------------------------------------------