This example is an extension of Mike Bostock’s tutorial Lets Make a Map that implements automatic label placement using collision detection. This is a proof of concept more than anything, not polished in any way.
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
x | y | z | lp_x | lp_y | lp_z | hp_x | hp_y | hp_z | ||
---|---|---|---|---|---|---|---|---|---|---|
0.235458 | -0.597702 | -0.724487 | 0.232433 | -0.593757 | -0.717156 | 0.003025 | -0.003945 | -0.007332 | ||
0.235458 | -0.597702 | -0.724487 | 0.232735 | -0.594152 | -0.717889 | 0.002723 | -0.003550 | -0.006598 | ||
0.217346 | -0.597702 | -0.724487 | 0.231197 | -0.594507 | -0.718549 | -0.013850 | -0.003195 | -0.005939 | ||
0.217346 | -0.579590 | -0.724487 | 0.229812 | -0.593015 | -0.719143 | -0.012465 | 0.013425 | -0.005345 | ||
0.199234 | -0.579590 | -0.724487 | 0.226754 | -0.591673 | -0.719677 | -0.027520 | 0.012083 | -0.004810 | ||
0.199234 | -0.597702 | -0.760712 | 0.224002 | -0.592276 | -0.723781 | -0.024768 | -0.005426 | -0.036931 | ||
0.163010 | -0.579590 | -0.706375 | 0.217903 | -0.591007 | -0.722040 | -0.054893 | 0.011417 | 0.015665 | ||
0.108673 | -0.597702 | -0.724487 | 0.206980 | -0.591676 | -0.722285 | -0.098307 | -0.006026 | -0.002203 | ||
0.090561 | -0.615814 | -0.724487 | 0.195338 | -0.594090 | -0.722505 | -0.104777 | -0.021724 | -0.001982 |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
license: gpl-3.0 |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
license: mit | |
height: 1000 | |
border: no | |
scrolling: no |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
license: mit |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
license: mit |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
license: gpl-3.0 |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
license: gpl-3.0 |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
license: gpl-3.0 |
The earlier example of this brushable radial chart led to some feedback to make the filtering better. I introduced a #circularBrush.filter(array,accessor) that takes an array of data and and accessor for that data and returns to you the data that falls into the area of the brush. The functionality of this chart is no different than the other, but if you take a look at the code, it's much more efficient.