Author: Aaron Wolin, Brandon Paulson and Tracy Hammond
Summary:
Chord length between 2 points - Sum of the euclidean distance between all the consecutive points between them.
Speed - chord length/ time difference.
In the first run , corners found based on the curvature and speed thresholds. If the corners are close together, one with lower curvature is removed.
The algorithm tries to remove false positives by merging 2 segments. It tries to check if the merged segment best fit into some primitive shape ( line/arc).
Discussion:
Simple and a powerful algorithm. I would like to see if it works well with helix and resistor type strokes.
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment