-
The following test case illustrates a situation in which Fortune's Sweep algorithm produces duplicate vertices.
Duplicate vertices will cause the post-processing polygonisation to fail, so they nee…
-
The project has two algorithms:
- Delaunay triangulation
- Fortune's Algorithm
The algorithms aren't well documented here. Without that domain knowledge, it's difficult to
make sense of how th…
-
Hey, I noticed that this code can generate VDs with sites being line segments and I was curious to know what algorithm it uses to do that.
I know Fortune's algorithm is used with points as sites bu…
-
it shows 7gb when its actually 9gb of ram use.
k2662 updated
4 months ago
-
Meta-issue to keep track of smaller things to do.
### fortune
- [x] String literals in types #260
- [x] Improve `include` syntax to allow querying at any level, like: `[['user', {...}], 'pets'…
-
**Describe the bug**
All rPackages from `cran-packages.nix` missing a `description` and `longDescription`.
https://nixos.org/nixos/packages.html?channel=nixos-19.09&query=rPackages
The CRAN w…
-
Hi Daniel!
I would love you to tackle a sketch on voronoi diagrams. I always find them so awesome to look at, and would like to understand them better.
Thank you :)
-
I have come a long way in trying to optimize this implementation of Fortune's Algorithm, but the latest iteration 57cb02c still under-performs. What I did accomplish is both, eliminate space leaks, an…
-
## Where is this model used
Mathematics/Various disciplines from the humanities, natural sciences, health industry, and engineering fields
## What is this model
A Voronoi diagram is a partition of …
-
I'm currently using rgeo for a large, web based, GIS project which needs to perform a Voronoi computation on a set of points and it ocurred to me that I could write it natively inside the rgeo gem.
I…