Refactor eval_pathseg_euclidean() to use kurbo's faster/more accurate inv_arclen()#3969
Refactor eval_pathseg_euclidean() to use kurbo's faster/more accurate inv_arclen()#3969
Conversation
There was a problem hiding this comment.
Code Review
This pull request refactors the eval_pathseg_euclidean function to utilize the inv_arclen method from the kurbo library, replacing a manual binary search implementation. Feedback suggests reintroducing a check for non-finite path lengths to ensure robustness, as the previous implementation included this guard.
node-graph/libraries/vector-types/src/vector/algorithms/bezpath_algorithms.rs
Show resolved
Hide resolved
Performance Benchmark Results
|
No description provided.