-
Related mbostock/d3#2401. For example: Manhattan, Chebychev, and Minovsky.
-
I encountered an issue that special input data can crash **voronoi.polygons**.
**Reproduce Demo**
```js
var d3 = require("d3");
var width = 400;
var height = 400;
// change width and hei…
-
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…
-
Currently:
- sprinkled throughout the code are some commented-out `cout
-
1.
In my knowledge, the time complexity of Fortune's Sweepline algorithm is O(n log n). This algorithm uses a balanced binary search tree(BBST) to insert/delete parabola and to do a binary search in …
-
https://hugopeters.me/posts/19/
-
This breaks for the following set of 60 points:
`[(0.984, 0.422), (0.260, 0.856), (0.602, 0.336), (0.346, 0.646), (0.234, 0.642), (0.374, 0.692), (0.388, 0.780), (0.078, 0.516), (0.956, 0.354), (0.27…
-
Hello, I think I found a problem with the polygon generation algorithm. When using a specific set of coordinates I get a polygon with only 2 sides (in my code).
I adapted the iOS example with my ow…
-
This might be something to take up with the FastJet authors themselves, but anytime that `fastjet.ClusterSequence` is called the FastJet banner gets printed to stdout.
For `fastjet` `v3.4.0.5`
`…
-
Developing reconstruction algorithms for Phase-2 is becoming more and more difficult and frustrating as CMSSW startup times have increased in the last few years.
This is what happens when we want to …