You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Some of the algorithms use a determinant to get point-vector orientations. With points near vectors, roundoff creates errors. Shewchuk's robust predicates should solve this. Ideally, we can include them as (numba-accelerated) Python code.
I don't believe the Python implementation is vectorized, so it would require a little Cython to get decent performance benchmarks. But it would be immediately useful for testing.
The text was updated successfully, but these errors were encountered:
Some of the algorithms use a determinant to get point-vector orientations. With points near vectors, roundoff creates errors. Shewchuk's robust predicates should solve this. Ideally, we can include them as (numba-accelerated) Python code.
Python bindings to the original C code (C code included):
https://pypi.org/project/geompreds/
Reimplementations:
C++ (templated): https://github.com/dengwirda/robust-predicate
Javascript: https://github.com/mourner/robust-predicates
Julia: https://github.com/JuliaGeometry/AdaptivePredicates.jl
I don't believe the Python implementation is vectorized, so it would require a little Cython to get decent performance benchmarks. But it would be immediately useful for testing.
The text was updated successfully, but these errors were encountered: