![]() |
![]() |
Implements the simplify algorithm. More...
Public Types | |
typedef PointDistanceStrategy | distance_strategy_type |
typedef detail::douglas_peucker< Point, PointDistanceStrategy > ::distance_type | distance_type |
Static Public Member Functions | |
template<typename Range , typename OutputIterator > | |
static OutputIterator | apply (Range const &range, OutputIterator out, distance_type const &max_distance) |
Implements the simplify algorithm.
The douglas_peucker strategy simplifies a linestring, ring or vector of points using the well-known Douglas-Peucker algorithm.
Point | the point type |
PointDistanceStrategy | point-segment distance strategy to be used |
typedef PointDistanceStrategy boost::geometry::strategy::simplify::douglas_peucker< Point, PointDistanceStrategy >::distance_strategy_type |
typedef detail::douglas_peucker< Point, PointDistanceStrategy >::distance_type boost::geometry::strategy::simplify::douglas_peucker< Point, PointDistanceStrategy >::distance_type |
static OutputIterator boost::geometry::strategy::simplify::douglas_peucker< Point, PointDistanceStrategy >::apply | ( | Range const & | range, |
OutputIterator | out, | ||
distance_type const & | max_distance | ||
) | [static] |
April 2, 2011 |
Copyright © 2007-2011 Barend Gehrels, Amsterdam, the Netherlands Copyright © 2008-2011 Bruno Lalande, Paris, France Copyright © 2009-2010 Mateusz Loskot, London, UK |