diff --git a/include/boost/geometry/algorithms/detail/extreme_points.hpp b/include/boost/geometry/algorithms/detail/extreme_points.hpp
index 951b27664..2d18749ea 100644
--- a/include/boost/geometry/algorithms/detail/extreme_points.hpp
+++ b/include/boost/geometry/algorithms/detail/extreme_points.hpp
@@ -57,9 +57,9 @@ inline void move_along_vector(PointType& point, PointType const& extreme, Coordi
     // Moves a point along the vector (point, extreme) in the direction of the extreme  point
     // This adapts the possibly uneven legs of the triangle (or trapezium-like shape) 
     //      _____extreme            _____
-    //     /     \                 /     \
-    //    /base   \         =>    /       \ point
-    //             \ point
+    //     /     \                 /     \                                    .
+    //    /base   \         =>    /       \ point                             .
+    //             \ point                                                    .
     //
     // For so-called intruders, it can be used to adapt both legs to the level of "base"
     // For the base, it can be used to adapt both legs to the level of the max-value of the intruders
@@ -244,7 +244,6 @@ struct extreme_points_on_ring
 
                     // we start at this intrusion until it is handled, and don't affect our initial left iterator
                     CirclingIterator left_intrusion_it = right;
-                    point_type local_top = *right;
                     typename boost::range_value<Intruders>::type intruder;
                     collect(ring, *right, intruder, left_intrusion_it, right);
 
diff --git a/include/boost/geometry/algorithms/point_on_surface.hpp b/include/boost/geometry/algorithms/point_on_surface.hpp
index 581e7857c..e662b1938 100644
--- a/include/boost/geometry/algorithms/point_on_surface.hpp
+++ b/include/boost/geometry/algorithms/point_on_surface.hpp
@@ -206,11 +206,11 @@ inline void replace_extremes_for_self_tangencies(Extremes& extremes, Intruders&
     // Self-tangencies use, as usual, the major part of code...
 
     //        ___ e
-    //       /|\ \          
-    //      / | \ \        
-    //     /  |  \ \       
-    //    /   |   \ \
-    //   / /\ |    \ \
+    //       /|\ \                                                            .
+    //      / | \ \                                                           .
+    //     /  |  \ \                                                          .
+    //    /   |   \ \                                                         .
+    //   / /\ |    \ \                                                        .
     //     i2    i1
 
     // The picture above shows the extreme (outside, "e") and two intruders ("i1","i2")
@@ -221,10 +221,10 @@ inline void replace_extremes_for_self_tangencies(Extremes& extremes, Intruders&
     // It then looks like:
 
     //      b ___ e
-    //       /|\ \          
-    //      / | \ \        
-    //     /  |  \ \       
-    //    /   |   \ \
+    //       /|\ \                                                            .
+    //      / | \ \                                                           .
+    //     /  |  \ \                                                          .
+    //    /   |   \ \                                                         .
     //   a    c i1
 
     // Then intruders (here "i1" but there may be more) are sorted from left to right