diff --git a/geo/src/algorithm/simplify.rs b/geo/src/algorithm/simplify.rs
index 1151c7698..c5cdb07da 100644
--- a/geo/src/algorithm/simplify.rs
+++ b/geo/src/algorithm/simplify.rs
@@ -153,7 +153,13 @@ where
 ///
 /// Multi* objects are simplified by simplifying all their constituent geometries individually.
 ///
-/// An epsilon less than or equal to zero will return an unaltered version of the geometry.
+/// A larger `epsilon` means being more aggressive about removing points with less concern for
+/// maintaining the existing shape.
+///
+/// Specifically, points closer than `epsilon` distance from the simplified output may be
+/// discarded.
+///
+/// An `epsilon` less than or equal to zero will return an unaltered version of the geometry.
 pub trait Simplify<T, Epsilon = T> {
     /// Returns the simplified representation of a geometry, using the [Ramer–Douglas–Peucker](https://en.wikipedia.org/wiki/Ramer–Douglas–Peucker_algorithm) algorithm
     ///
@@ -192,7 +198,13 @@ pub trait Simplify<T, Epsilon = T> {
 /// This operation uses the [Ramer–Douglas–Peucker algorithm](https://en.wikipedia.org/wiki/Ramer–Douglas–Peucker_algorithm)
 /// and does not guarantee that the returned geometry is valid.
 ///
-/// An epsilon less than or equal to zero will return an unaltered version of the geometry.
+/// A larger `epsilon` means being more aggressive about removing points with less concern for
+/// maintaining the existing shape.
+///
+/// Specifically, points closer than `epsilon` distance from the simplified output may be
+/// discarded.
+///
+/// An `epsilon` less than or equal to zero will return an unaltered version of the geometry.
 pub trait SimplifyIdx<T, Epsilon = T> {
     /// Returns the simplified indices of a geometry, using the [Ramer–Douglas–Peucker](https://en.wikipedia.org/wiki/Ramer–Douglas–Peucker_algorithm) algorithm
     ///
diff --git a/geo/src/algorithm/simplify_vw.rs b/geo/src/algorithm/simplify_vw.rs
index 47e5c2971..ec5ed9627 100644
--- a/geo/src/algorithm/simplify_vw.rs
+++ b/geo/src/algorithm/simplify_vw.rs
@@ -479,7 +479,12 @@ pub trait SimplifyVw<T, Epsilon = T> {
 /// This operation uses the Visvalingam-Whyatt algorithm,
 /// and does **not** guarantee that the returned geometry is valid.
 ///
-/// An epsilon less than or equal to zero will return an unaltered version of the geometry.
+/// A larger `epsilon` means being more aggressive about removing points with less concern for
+/// maintaining the existing shape. Specifically, when you consider whether to remove a point, you
+/// can draw a triangle consisting of the candidate point and the points before and after it.
+/// If the area of this triangle is less than `epsilon`, we will remove the point.
+///
+/// An `epsilon` less than or equal to zero will return an unaltered version of the geometry.
 pub trait SimplifyVwIdx<T, Epsilon = T> {
     /// Returns the simplified representation of a geometry, using the [Visvalingam-Whyatt](http://www.tandfonline.com/doi/abs/10.1179/000870493786962263) algorithm
     ///
@@ -516,7 +521,12 @@ pub trait SimplifyVwIdx<T, Epsilon = T> {
 
 /// Simplifies a geometry, attempting to preserve its topology by removing self-intersections
 ///
-/// An epsilon less than or equal to zero will return an unaltered version of the geometry
+/// A larger `epsilon` means being more aggressive about removing points with less concern for
+/// maintaining the existing shape. Specifically, when you consider whether to remove a point, you
+/// can draw a triangle consisting of the candidate point and the points before and after it.
+/// If the area of this triangle is less than `epsilon`, we will remove the point.
+///
+/// An `epsilon` less than or equal to zero will return an unaltered version of the geometry.
 pub trait SimplifyVwPreserve<T, Epsilon = T> {
     /// Returns the simplified representation of a geometry, using a topology-preserving variant of the
     /// [Visvalingam-Whyatt](http://www.tandfonline.com/doi/abs/10.1179/000870493786962263) algorithm.