sweep-bptree
A b+ tree, locality aware, so it's faster for ordered access (by shuoli84)
poly2tri-rs
Rust port for poly2tri cpp library (by shuoli84)
| sweep-bptree | poly2tri-rs | |
|---|---|---|
| 2 | 2 | |
| 9 | 15 | |
| - | - | |
| 6.1 | 4.0 | |
| about 1 year ago | about 1 year ago | |
| Rust | Rust | |
| Apache License 2.0 | Apache License 2.0 |
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
sweep-bptree
Posts with mentions or reviews of sweep-bptree.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2023-04-04.
-
sweep-bptree 0.4.0 released, initial support for Argumentation
Also check out EvenCount example, it shows how to use Argumentation to keep track of total number of even keys in the map.
-
Introduce sweep-bptree, a in memory b+tree implementation which performs better for local access
Here is the github link: sweep-bptree
poly2tri-rs
Posts with mentions or reviews of poly2tri-rs.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2023-04-04.
-
Introduce sweep-bptree, a in memory b+tree implementation which performs better for local access
While developing poly2tri-rs, I need a performant data structure to maintain the `sweeping/advancing front`. It's access pattern is like: query a point, doing calculation and modification, then try prev/next point. B+Tree stores all data on leafs, which is quite nice for cache.
-
poly2tri-rs, an idiomatic and fast rust lib(port) for triangulation
Here it is: https://github.com/shuoli84/poly2tri-rs
What are some alternatives?
When comparing sweep-bptree and poly2tri-rs you can also consider the following projects:
poly2tri - 2D constrained Delaunay triangulation library
delaunator-rs - Fast 2D Delaunay triangulation in Rust. A port of Delaunator.