...one of the most highly
regarded and expertly designed C++ library projects in the
world.
— Herb Sutter and Andrei
Alexandrescu, C++
Coding Standards
Implements the simplify algorithm.
The douglas_peucker strategy simplifies a linestring, ring or vector of points using the well-known Douglas-Peucker algorithm. For the algorithm, see for example:
template<typename Point, typename PointDistanceStrategy> class strategy::simplify::douglas_peucker { // ... };
Parameter |
Description |
---|---|
typename Point |
the point type |
typename PointDistanceStrategy |
point-segment distance strategy to be used |
Function |
Description |
Parameters |
Returns |
---|---|---|---|
template<typename Range, typename OutputIterator> OutputIterator apply(Range const & range, OutputIterator out, double max_distance)
|
Range const &: range: OutputIterator: out: double: max_distance: |
#include <boost/geometry/strategies/agnostic/simplify_douglas_peucker.hpp>