fix direction

Author: NailxSharipov

docs-gen/src/overlay/extract/extract_shapes.md

@@ -11,13 +11,13 @@ Once we apply boolean filter to [Overlay Graph](../overlay_graph/overlay_graph.m
 
 The algorithm starts by selecting the leftmost node and proceeds by choosing the topmost segment connected to that node. The process continues by traversing to the next node along the selected segment.
 
-At each node, the algorithm selects the next segment by rotating around the current node in a clockwise/counterclockwise direction for inner/outer contours and taking the first nearest segment.
+At each node, the algorithm selects the next segment by rotating around the current node in a clockwise/counterclockwise direction for outer/inner contours and taking the first nearest segment.
 
 To prevent segments from being visited twice, each segment is marked as visited upon traversal.
 
 This process continues until the contour is complete, forming either an <span style="color:#ff3333ff;">**outer**</span> or <span style="color:#1a8effff;">**inner**</span> contour.
 
-By following this approach, <span style="color:#ff3333ff;">**outer**</span> contours are extracted in a clockwise direction, while <span style="color:#1a8effff;">**inner**</span> contours are extracted in a counterclockwise direction.
+By following this approach, <span style="color:#ff3333ff;">**outer**</span> contours are extracted in a counter-clockwise direction, while <span style="color:#1a8effff;">**inner**</span> contours are extracted in a clockwise direction.
 
 ## Define Contour
 ![Define Contour](define_contour.svg)

docs/overlay/extract/extract_shapes.html

@@ -162,10 +162,10 @@ <h3 id="outer-contour"><a class="header" href="#outer-contour">Outer Contour</a>
 <h3 id="inner-contour"><a class="header" href="#inner-contour">Inner Contour</a></h3>
 <p><img src="extract_inner_clockwise.svg" alt="Extract Contour" /></p>
 <p>The algorithm starts by selecting the leftmost node and proceeds by choosing the topmost segment connected to that node. The process continues by traversing to the next node along the selected segment.</p>
-<p>At each node, the algorithm selects the next segment by rotating around the current node in a clockwise/counterclockwise direction for inner/outer contours and taking the first nearest segment.</p>
+<p>At each node, the algorithm selects the next segment by rotating around the current node in a clockwise/counterclockwise direction for outer/inner contours and taking the first nearest segment.</p>
 <p>To prevent segments from being visited twice, each segment is marked as visited upon traversal.</p>
 <p>This process continues until the contour is complete, forming either an <span style="color:#ff3333ff;"><strong>outer</strong></span> or <span style="color:#1a8effff;"><strong>inner</strong></span> contour.</p>
-<p>By following this approach, <span style="color:#ff3333ff;"><strong>outer</strong></span> contours are extracted in a clockwise direction, while <span style="color:#1a8effff;"><strong>inner</strong></span> contours are extracted in a counterclockwise direction.</p>
+<p>By following this approach, <span style="color:#ff3333ff;"><strong>outer</strong></span> contours are extracted in a counter-clockwise direction, while <span style="color:#1a8effff;"><strong>inner</strong></span> contours are extracted in a clockwise direction.</p>
 <h2 id="define-contour"><a class="header" href="#define-contour">Define Contour</a></h2>
 <p><img src="define_contour.svg" alt="Define Contour" /></p>
 <p>To define a contour, the algorithm begins by identifying the leftmost and topmost segment in the contour. The classification of the contour is determined as follows:</p>

docs/print.html

@@ -1217,10 +1217,10 @@ <h3 id="outer-contour-1"><a class="header" href="#outer-contour-1">Outer Contour
 <h3 id="inner-contour"><a class="header" href="#inner-contour">Inner Contour</a></h3>
 <p><img src="overlay/extract/extract_inner_clockwise.svg" alt="Extract Contour" /></p>
 <p>The algorithm starts by selecting the leftmost node and proceeds by choosing the topmost segment connected to that node. The process continues by traversing to the next node along the selected segment.</p>
-<p>At each node, the algorithm selects the next segment by rotating around the current node in a clockwise/counterclockwise direction for inner/outer contours and taking the first nearest segment.</p>
+<p>At each node, the algorithm selects the next segment by rotating around the current node in a clockwise/counterclockwise direction for outer/inner contours and taking the first nearest segment.</p>
 <p>To prevent segments from being visited twice, each segment is marked as visited upon traversal.</p>
 <p>This process continues until the contour is complete, forming either an <span style="color:#ff3333ff;"><strong>outer</strong></span> or <span style="color:#1a8effff;"><strong>inner</strong></span> contour.</p>
-<p>By following this approach, <span style="color:#ff3333ff;"><strong>outer</strong></span> contours are extracted in a clockwise direction, while <span style="color:#1a8effff;"><strong>inner</strong></span> contours are extracted in a counterclockwise direction.</p>
+<p>By following this approach, <span style="color:#ff3333ff;"><strong>outer</strong></span> contours are extracted in a counter-clockwise direction, while <span style="color:#1a8effff;"><strong>inner</strong></span> contours are extracted in a clockwise direction.</p>
 <h2 id="define-contour"><a class="header" href="#define-contour">Define Contour</a></h2>
 <p><img src="overlay/extract/define_contour.svg" alt="Define Contour" /></p>
 <p>To define a contour, the algorithm begins by identifying the leftmost and topmost segment in the contour. The classification of the contour is determined as follows:</p>