adilyalcin / Keshif

Keshif - Data Made Explorable (Prototype)
https://keshif.me
BSD 3-Clause "New" or "Revised" License
458 stars 123 forks source link

Update to d3 v4. #152

Closed adilyalcin closed 7 years ago

adilyalcin commented 8 years ago

Once d3 v4 branch has gone stable and some bugfixes follow, update Keshif dependency and implementation to take advantage of improvements.

Candidate features:

Link to d3 changes (v4.0) readme: https://github.com/d3/d3/blob/a7caf9375fe14d7235562af541fe9decf499bbfb/CHANGES.md

adilyalcin commented 8 years ago

Check if d3 ticks implementation is improved for internal keshif use. "If you specify a desired number of bins rather than thresholds, d3.histogram now uses d3.ticks to compute nice bin thresholds. In addition to the default Sturges’ formula, D3 now implements the Freedman-Diaconis rule and Scott’s normal reference rule."

adilyalcin commented 8 years ago

Improve node selection by finding the closest node to the pointer instead of exact match:

" As an alternative to a Voronoi SVG overlay, you can now use simulation.find to find the closest node to a pointer. C

adilyalcin commented 8 years ago

Use d3.request rather than ajax request to remove jquery dependency.

adilyalcin commented 8 years ago

Create a minified d3 dependency that only includes the modules used by keshif.

adilyalcin commented 7 years ago

See https://github.com/d3/d3-array for details on binning / threshold algorithms d3.thresholdFreedmanDiaconis d3. thresholdScott d3. thresholdSturges

adilyalcin commented 7 years ago

Done!