diff --git a/README.md b/README.md
index 04aab5e..bbae669 100644
--- a/README.md
+++ b/README.md
@@ -7,6 +7,7 @@ In particular, emphasis has been placed on making smooth animations for the tran
 Polyblade runs on [WGPU](https://github.com/gfx-rs/wgpu) and [Iced](https://github.com/iced-rs/iced).
 Using the PST distance algorithm for efficient all pairs shortest paths in the unweighted undirected graphs represented by polyhedra, none of the vertex position data is deterministic. Instead, this distance matrix is used to create spring forces between every node pair $v_i, v_j$ where $v_n \in G$. Proportional to their distance in the graph structure $G$, the springs inflate the polyhedron to proportional size, allowing us to visualize these strucutres even when they break convexity. 
 
+
 #### Conway Roadmap
 - [x] Ambo
 - [x] Kis