From 27caab69ec1f8e84e466c368fdbca60da6b6d61b Mon Sep 17 00:00:00 2001 From: Patrick Niklaus Date: Mon, 27 Oct 2014 22:43:25 +0100 Subject: [PATCH] Fix broken DP --- Algorithms/DouglasPeucker.cpp | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/Algorithms/DouglasPeucker.cpp b/Algorithms/DouglasPeucker.cpp index 24bacedc9..09ad4e5da 100644 --- a/Algorithms/DouglasPeucker.cpp +++ b/Algorithms/DouglasPeucker.cpp @@ -151,7 +151,7 @@ void DouglasPeucker::Run(RandomAccessIt begin, RandomAccessIt end, const unsigne const GeometryRange pair = recursion_stack.top(); recursion_stack.pop(); // sanity checks - BOOST_ASSERT_MSG(pair.first->necessary, "left border mus be necessary"); + BOOST_ASSERT_MSG(pair.first->necessary, "left border must be necessary"); BOOST_ASSERT_MSG(pair.second->necessary, "right border must be necessary"); BOOST_ASSERT_MSG(std::distance(pair.second, end) > 0, "right border outside of geometry"); BOOST_ASSERT_MSG(std::distance(pair.first, pair.second) >= 0, "left border on the wrong side"); @@ -181,7 +181,7 @@ void DouglasPeucker::Run(RandomAccessIt begin, RandomAccessIt end, const unsigne { recursion_stack.emplace(pair.first, farthest_entry_it); } - if (1 < std::distance(pair.second, farthest_entry_it)) + if (1 < std::distance(farthest_entry_it, pair.second)) { recursion_stack.emplace(farthest_entry_it, pair.second); }