David Bumbeishvili bumbeishvili

Implementing a variation of Joachim Ungar's curved label placement method described here. The basic process is:

Turn the shape into a polygon of evenly-spaced points.
Generate a Voronoi diagram of those points.
Clip the edges.
Turn the edges into a graph.
Find the "longest shortest path" between any pair of perimeter nodes.
Smooth/simplify that path a bit.
Place text along the smoothed centerline with a <textPath>.

Force Directed with Voronoi selection

This is a fork of mbostock's block: Force-Directed Graph where I've added a voronoi overlay. This could have a practical use by not having to click directly on a node in order select it and drag it.

From the original block:

This simple force-directed graph shows character co-occurence in Les Misérables. A physical simulation of charged particles and springs places related characters in closer proximity, while unrelated characters are farther apart. Layout algorithm inspired by Tim Dwyer and Thomas Jakobsen. Data based on character coappearence in Victor Hugo's Les Misérables, compiled by Donald Knuth.

Wars dataset from COW. Each path represents a war and associated circles represent the number of victims. Inspired from Valentina D'Efilippo's work