-
I was really excited to see a swift voronoi diagram framework and cloned the repo right away! However, I can't build it because it has a dependency on OmniSwift.
So what is OmniSwift? How do I get it…
-
The DelaunayCubic class is great, but needs to be renamed to BravaisLattice. This is the general term for any cubic packing and there is well-defined notation for the lattice structure which should b…
-
I'd love to see the algorithm of https://github.com/mapbox/polylabel in Shapely.
-
https://github.com/tsoding/voronoi-diagram/blob/363afbdc78c5ad23db9248cc56ee226bce17fb96/src/main.ml#L14
rexim updated
8 years ago
-
## Relations
## Useful links
- https://en.wikipedia.org/wiki/K-d_tree
## Description
To speed up querying nearest site for each pixel we can introduce space partitioning, e.g. grid or binary tree. Of…
-
- [ ] Remove memory leaks
- [ ] Store which segments are connected to each dot
-
sections:
> always everything only on half the data
1. data
1. which dataset
2. definition of markers
3. how did puncta get to us (what computer vision)
4. definition of features (with eq…
-
It would be interesting to see visualization of Voronoi diagram with another distance function, e.g. Manhattan distance [1]. Alternatively you can generalize current distance with p-norm [2].
[1] htt…
-
## Relations
## Description
We need a way to restrict amount of created process when we use our futures. It's not process pool like in #21, it's just a limit of amount of processes. So if I do someth…
rexim updated
8 years ago
-
Hi gents,
I noticed that with more complex designs the slicing and then specifically the layer preview can take a lot of time to calculate.
Here is an example - it also nearly fills the Ultimaker bu…