Fast algorithm for two-dimensional bin packing with a minimum distance of each rectangle and point

This seems like a problem with packaging beans , but with some changes.

I have a time series of annotated data, and when I draw a chart, I want to place annotations in a position that generally minimizes the distance from the annotated point.

This chart (free stolen) shows that I like to do: .

, , , . , , x / y, , , , . , , , - .

, - , ?

: , . , .

+5
2

. . .

+4

: " " . - . , , , , .

, . , (.. , ) . , , .

+1

All Articles