Update Pipline
parent
a2164929ba
commit
5acb7c71ca
@ -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.
|
||||
- Check distance vs tolerance (ε)
|
||||
- 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
|
||||
- Apply the same process to each new segment.
|
||||
|
||||
|
||||
Loading…
Reference in New Issue
Block a user