diff --git a/fj-kernel/src/algorithms/triangulation/delaunay.rs b/fj-kernel/src/algorithms/triangulation/delaunay.rs
index d288edfae..6629990c7 100644
--- a/fj-kernel/src/algorithms/triangulation/delaunay.rs
+++ b/fj-kernel/src/algorithms/triangulation/delaunay.rs
@@ -5,7 +5,7 @@ use spade::HasPosition;
 use crate::geometry;
 
 /// Create a Delaunay triangulation of all points
-pub fn delaunay(
+pub fn triangulate(
     points: Vec<geometry::Point<2>>,
 ) -> Vec<[geometry::Point<2>; 3]> {
     use spade::Triangulation as _;
diff --git a/fj-kernel/src/algorithms/triangulation/mod.rs b/fj-kernel/src/algorithms/triangulation/mod.rs
index f8cee7b17..992ca94a1 100644
--- a/fj-kernel/src/algorithms/triangulation/mod.rs
+++ b/fj-kernel/src/algorithms/triangulation/mod.rs
@@ -53,7 +53,7 @@ pub fn triangulate(
                         },
                     ));
 
-                let mut triangles = delaunay::delaunay(points);
+                let mut triangles = delaunay::triangulate(points);
                 triangles.retain(|triangle| {
                     face_as_polygon.contains_triangle(
                         triangle.map(|point| point.native()),