Hamza/TrackEngine
1
0 Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Update Pipline

Hamza committed 2026-03-30 09:26:47 +02:00
1 parent a2164929ba
commit 5acb7c71ca
1 file changed
+1 -1
Download Patch File Download Diff File Expand all files Collapse all files
Pipline.md
+1 -1
@@ -80,7 +80,7 @@ We choosed Ramer-Douglas-Peucker Algorithm as it the most common algorithm but t
- Look for the point between them that is farthest from the straight line connecting the endpoints. - Look for the point between them that is farthest from the straight line connecting the endpoints.
- Check distance vs tolerance (ε) - Check distance vs tolerance (ε)
- If the distance is greater than ε (epsilon) → keep that point and split the line there. - If the distance is greater than ε (epsilon) → keep that point and split the line there.
- If the distance is less than ε → remove all intermediate points (they’re not important). - If the distance is less than ε → remove all intermediate points (they're not important).
- Repeat recursively - Repeat recursively
- Apply the same process to each new segment. - Apply the same process to each new segment.