diff --git a/src/axom/primal/operators/detail/intersect_bezier_impl.hpp b/src/axom/primal/operators/detail/intersect_bezier_impl.hpp
index 59cc00389e..b467cb302c 100644
--- a/src/axom/primal/operators/detail/intersect_bezier_impl.hpp
+++ b/src/axom/primal/operators/detail/intersect_bezier_impl.hpp
@@ -88,7 +88,7 @@ bool intersect_bezier_curves(const BezierCurve<T, NDIMS> &c1,
  * As such, the we do not consider the lines to intersect if they do so
  * at the endpoints \a b or \d, respectively.
  *
- * \note This function assumes the all intersections have multiplicity 
+ * \note This function assumes the all intersections have multiplicity
  * one, i.e. there are no points at which the curves and their derivatives
  * both intersect. Thus, the function does not find tangencies.
  *
diff --git a/src/axom/primal/operators/detail/intersect_curved_poly_impl.hpp b/src/axom/primal/operators/detail/intersect_curved_poly_impl.hpp
index 79749f890f..1b6029ba38 100644
--- a/src/axom/primal/operators/detail/intersect_curved_poly_impl.hpp
+++ b/src/axom/primal/operators/detail/intersect_curved_poly_impl.hpp
@@ -285,8 +285,6 @@ class DirectionalWalk
    */
   void findIntersectionRegions(std::vector<CurvedPolygonType>& pnew)
   {
-    using EdgeIndex = Junction::EdgeIndex;
-
     PolygonEdge currentEdge[2] = {PolygonEdge(0, edgelabels[0]),
                                   PolygonEdge(1, edgelabels[1])};