diff --git a/geometry/graham_scan_functions.hpp b/geometry/graham_scan_functions.hpp
index 47c7851fc..96363ec46 100644
--- a/geometry/graham_scan_functions.hpp
+++ b/geometry/graham_scan_functions.hpp
@@ -13,7 +13,7 @@
  *subset.
  *
  * The worst case time complexity of Jarvis’s Algorithm is O(n^2). Using
- *Graham’s scan algorithm, we can find Convex Hull in O(nLogn) time.
+ * Graham’s scan algorithm, we can find Convex Hull in O(nLogn) time.
  *
  * ### Implementation
  *