Sep 9, 2025 · Sep 8, 2025
diff --git a/src/geometry/intersecting_segments.md b/src/geometry/intersecting_segments.md
 ## Algorithm

 Let's draw a vertical line $x = -\infty$ mentally and start moving this line to the right.
 In the course of its movement, this line will meet with segments, and at each time a segmentintersect with our line it intersects in exactly one point (we will assume that there are no vertical segments).
 In the course of its movement, this line will meet with segments, and at each time a segmentintersects with our line it intersects in exactly one point (we will assume that there are no vertical segments).

 <div style="text-align: center;">
  <img src="sweep_line_1.png" alt="sweep line and line segment intersection">
Original file line number	Diff line number	Diff line change
Expand Up		@@ -14,7 +14,7 @@ The naive solution algorithm is to iterate over all pairs of segments in $O(n^2)
		## Algorithm

		Let's draw a vertical line $x = -\infty$ mentally and start moving this line to the right.
		In the course of its movement, this line will meet with segments, and at each time a segmentintersect with our line it intersects in exactly one point (we will assume that there are no vertical segments).
		In the course of its movement, this line will meet with segments, and at each time a segmentintersects with our line it intersects in exactly one point (we will assume that there are no vertical segments).

		<div style="text-align: center;">
		<img src="sweep_line_1.png" alt="sweep line and line segment intersection">
Expand Down