diff --git a/crates/fj-kernel/src/algorithms/intersect/ray_face.rs b/crates/fj-kernel/src/algorithms/intersect/ray_face.rs
index 5882e25ee..e4349f56c 100644
--- a/crates/fj-kernel/src/algorithms/intersect/ray_face.rs
+++ b/crates/fj-kernel/src/algorithms/intersect/ray_face.rs
@@ -217,7 +217,6 @@ mod tests {
             .copied()
             .find(|edge| {
                 let [a, b] = edge.vertices().get_or_panic();
-                dbg!((a.global().position(), b.global().position()));
                 a.global().position() == Point::from([1., 0., 1.])
                     && b.global().position() == Point::from([1., 0., -1.])
             })
diff --git a/crates/fj-kernel/src/algorithms/sweep/edge.rs b/crates/fj-kernel/src/algorithms/sweep/edge.rs
index e12604e78..5fb0eeb48 100644
--- a/crates/fj-kernel/src/algorithms/sweep/edge.rs
+++ b/crates/fj-kernel/src/algorithms/sweep/edge.rs
@@ -23,10 +23,10 @@ impl Sweep for Edge {
         let path = path.into();
         let tolerance = tolerance.into();
 
-        if let Some(vertices) = self.vertices().get() {
+        if let Some(vertices) = self.global().vertices().get() {
             let face = create_non_continuous_side_face(
                 path,
-                vertices.map(|vertex| *vertex.global()),
+                vertices.map(|vertex| *vertex),
                 color,
             );
             return face;
diff --git a/crates/fj-kernel/src/algorithms/triangulate/delaunay.rs b/crates/fj-kernel/src/algorithms/triangulate/delaunay.rs
index ce6ccf08f..328dc642e 100644
--- a/crates/fj-kernel/src/algorithms/triangulate/delaunay.rs
+++ b/crates/fj-kernel/src/algorithms/triangulate/delaunay.rs
@@ -32,7 +32,7 @@ pub fn triangulate(
     triangles
 }
 
-#[derive(Clone, Copy, Eq, PartialEq, Hash, Ord, PartialOrd)]
+#[derive(Clone, Copy, Debug, Eq, PartialEq, Hash, Ord, PartialOrd)]
 pub struct TriangulationPoint {
     pub point_surface: Point<2>,
     pub point_global: Point<3>,