kcnarf / d3-beeswarm Goto Github PK

The presented algorithm seems to have a lower complexity, as it can determine the first y position allowing to place a new data.

Considering 2 consecutive already arranged points, one can determine if a place is available. If not, consider visit the 2 next above/below consecutive already arranged points. return the first available place.

The above image is a snapshot of the block presenting this plugin.
In this snapshot, in the red circle, data is not arranged around the x-axis.

Follow @mbostok's directives (cf. https://bost.ocks.org/mike/d3-plugin/)
And add tests !

Exceeding strategies could be:

• omit exceeding data
• wrap (overlapping at maximum size)
• place data at modulo(maxSize) (overlapping in the center of the blob)
• automatic radius reduction
• automatic stretching with overlapping like d3.layout.force

detect if data is already sorted, for computation optimization (x-based possible colliders are easier to detect, cf. this block)

If detection is not conceivable, add an API to set it.