Platform
Solutions
Resources
Pricing
Sign in
Sign up
Fil
Vocateur.
Workspace
Fork
Public
2 collections
By
Fil
Edited
Feb 16, 2023
2 stars
Algorithms
Chandrupatla’s root-finding method
Sidi’s root-finding method
Regular numbers
DruidJS worker
Natural breaks
Distance to a segment
Ray out of a convex hull
Word Tour: 40k words and their friends
Hello, @thi.ng/grid-iterators
Head/tail breaks
Pseudo-blue noise shader
How fast does walk-on-spheres converge?
AoC 12: shortest path under constraints
KDE estimation
Plot: Correlation heatmap
Poisson Finish 2
Poisson disk sampling functions
WoS with transport
Simple and surprising sort
Local median
Time series topological subsampling
Union-Find
Level set experiment 1
Mean value coordinates
Poisson potential
Middle-square
World of squares (spherical)
World of squares
Largest Inscribed Square
Hello, PyWavelets
Geothmetic meandian
Hello, Reorder.js
Geometric Median
Image FFT
Transport to a map
Disc Transport
TP3: Power Diagram and Semi-Discrete Optimal Transport
The blue wave
Hello, genetic-js
Sliced Optimal Transport
DruidJS
Self-Organizing Maps meet Delaunay
Hello, polygon-clipping
seedrandom, minimal
Walk on Spheres 2
Walk on Spheres
Hello, Autoencoder
Kaprekar’s number
VoronoiMap2D
Hello, ccwt.js
Polygon Triangulation
Quantile.invert?
Linear congruential generator
Hue blur
Needle in a haystack
Moving average blur
Apollo 11 implementation of trigonometric functions, by Margaret H. Hamilton (march 1969)
2D curves intersection
The 2D approximate Newton-Raphson method
Inverting Lee’s Tetrahedral projection
Linde–Buzo–Gray stippling
Mean shift clustering with kd-tree
2D point distributions
Shortest path
Kahan Summation
Hello, delatin
Dijkstra’s algorithm in gpu.js
Lloyd’s relaxation on a graph
Manhattan Diameter
Manhattan Voronoi
Mobility landscapes — an introduction
Dijkstra’s shortest-path tree
H3 oddities
Protein Matrix
Convex Spectral Weights
Sort stuff by similarity
Kriging
Delaunay.findTriangle
n-dimensions binning?
Travelling with a self-organizing map
UMAP-o-Matic
MNIST & UMAP-js
Hello UMAP-js
Mean shift clustering
Levenshtein transition
Rd quasi-random sequences
Automated label placement (countries)
Phyllotaxis explained
Motionrugs
Planar hull (Andrew’s monotone chain algorithm)
South Africa’s medial axis
Travelling salesperson approximation with t-SNE
Distance to shore
Worker
ngraph: pagerank, louvain…
t-SNE Voronoi
Cloud Contours
Circular function drawing
Kruskal Maze
Mycelium
Travelling salesperson approximation on the globe, with t-SNE
tsne.js
tsne.js & worker
Also listed in…
Clustering
Insert cell
Insert cell
function
headTail0
(
values
)
{
values
=
[
...
values
]
;
const
bins
=
[
d3
.
min
(
values
)
]
;
let
m
=
d3
.
mean
(
values
)
;
while
(
values
.
length
>
1
)
bins
.
push
(
(
m
=
d3
.
mean
(
(
values
=
values
.
filter
(
(
d
)
=>
d
>
m
)
)
)
)
)
;
return
bins
;
}
Insert cell
headTail0
(
[
1
,
1
,
1
,
1
,
1
,
1
,
2
,
2
,
2
,
2
,
2
,
2
,
3
,
3
,
3
,
3
,
3
,
3
,
3
,
3
,
3
,
2
,
2
,
2
,
2
,
1
,
1
,
12
,
3
,
4
,
5
,
6
,
7
,
8
,
9
,
10
,
11
,
5
,
6
,
7
,
6
,
5
,
6
,
7
,
8
,
8
,
9
,
8
,
7
,
6
,
7
,
8
,
9
,
1
,
1
,
1
,
1
,
1
,
1
,
1
,
2
,
2
,
2
,
3
,
3
,
3
,
4
,
4
,
4
,
3
,
2
,
2
,
2
,
1
,
1
,
1
]
)
Insert cell
One platform
to build and deploy the best data apps
Experiment and prototype by building visualizations in live JavaScript notebooks. Collaborate with your team and decide which concepts to build out.
Use Observable Framework to build data apps locally. Use data loaders to build in any language or library, including Python, SQL, and R.
Seamlessly deploy to Observable. Test before you ship, use automatic deploy-on-commit, and ensure your projects are always up-to-date.
Try it for free
Learn more
Fork
View
Export
Listed in...
Clustering
Fil
Algorithms
Fil
Edit
Add comment
Select
Duplicate
Copy link
Embed
Delete
JavaScript
Markdown
HTML
headTail0
Add comment
Copy import
Select
Duplicate
Copy link
Embed
Delete
JavaScript
Markdown
HTML
Add comment
Select
Duplicate
Copy link
Embed
Delete
JavaScript
Markdown
HTML