Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Spatial sorting for fast insertion #34

Closed
DanielVandH opened this issue Feb 23, 2023 · 1 comment
Closed

Spatial sorting for fast insertion #34

DanielVandH opened this issue Feb 23, 2023 · 1 comment

Comments

@DanielVandH
Copy link
Member

It would be nice to have a method for sorting points in space, such as with a Hilbert sort. Obviously this could be provided by the user (with the point_order kwarg), but it would be nice to have a function in the code for ease of use. Will need to find some implementation for it that works for general points without any domain restrictions.

The main objective would be to implement a biased randomised insertion order (see Sec 5.3 of the Delaunay book) based on this spatial sorting.
@DanielVandH DanielVandH mentioned this issue Jun 16, 2023
Closed
7 tasks
@DanielVandH DanielVandH closed this as not planned Won't fix, can't repro, duplicate, stale Apr 14, 2024
@DanielVandH
Copy link
Member Author

Would be nice, but really not something I'm interested in bringing into this package. This can be done externally.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@DanielVandH