Is your feature request related to a problem? Please describe.

Complex paths require more computation, degrading performance.

Describe the solution you'd like

I would like to propose using spatial indexing to exponentially reduce runtime computation.
The convex hull can be used to index and query a path instead of iterating over all its hulls.
Since the path is known in advance and is finite a quad tree or a nested grid should fit perfectly.
It came to me since I am working on spatial indexing of another problem so I might be able to port the solution over.

Describe alternatives you've considered

Publishing an npm package that wraps around this package

Additional context

I am willing to PR