[B! ãƒœãƒãƒŽã‚¤] go5025ã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯

go5025 id:go5025

ãƒœãƒãƒŽã‚¤ã«é–¢ã™ã‚‹go5025ã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯ (2)

${{author_name}}$

{{{comment_expanded}}}

{{label}}

{{#is_bookmark}}ãƒªã‚¹ãƒˆ{{/is_bookmark}}{{^is_bookmark}}ãƒªãƒ³ã‚¯{{/is_bookmark}}

${{author_name}}$
{{author_name}}{{created}}
{{ #comment }}{{ comment }}{{ /comment }}
- {{ label }}

${{author_name}}$

{{{comment_expanded}}}

{{label}}

{{#is_bookmark}}ãƒªã‚¹ãƒˆ{{/is_bookmark}}{{^is_bookmark}}ãƒªãƒ³ã‚¯{{/is_bookmark}}

ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ TM's Workspace -
ãƒœãƒãƒŽã‚¤å›³ã®ç”Ÿæˆã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã«ã€ŒFortuneâ€™s Algorithm ã€ãŒã‚ã‚Šã¾ã™ã€‚ ãƒœãƒãƒŽã‚¤å›³ã¯ã€è‰²ã€…ã¨æœ‰ç”¨ãªã®ã§ã€ã€ŒFortuneâ€™s Algorithm in C++ã€ã‚’å‚è€ƒã«ã€Javascriptç‰ˆã‚’å®Ÿè£…ï¼ˆã¨ã„ã†ã‹ç§»æ¤ï¼‰ã—ã¦ã¿ã¾ã—ãŸã€‚ ã¾ãŸã€ã›ã£ã‹ããªã®ã§ã€fumixæ°ãŒWonderflã«æŠ•ç¨¿ã•ã‚Œã¦ã„ã‚‹ã€Œè¶…é€ŸãƒœãƒãƒŽã‚¤å›³ã€é¢¨ã®JavaScriptã‚¢ãƒ‹ãƒ¡ãƒ¼ã‚·ãƒ§ãƒ³ã‚’ä½œæˆã—ã¦ã¿ã¾ã—ãŸã€‚ å‹•ä½œç¢ºèªã¯ã€IE8ã€Chromeã€Android1.6(IS01ï¼‰ã§è¡Œã„ã¾ã—ãŸã€‚IS01ã§ã‚‚ãã‚Œãªã‚Šã«å‹•ã„ã¦ã„ã¾ã™ï¼ˆç”»åƒï¼‰ã€‚ â†’å®Ÿã€€è¡Œ å…¨æ–‡ã‚’èªã‚€
go5025 2012/05/22
ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ

ãƒœãƒãƒŽã‚¤

treemap

å¯è¦–åŒ–
ãƒªãƒ³ã‚¯
voronoi treemap algorithm - information aesthetics
a novel treemap data visualization approach that uses Voronoi tesselations (a polygon-based subdivision algorithm) instead of rectangular shapes. it attempts to avoid the probl ems with the aspect ratio of the rectangles as well as with identifying the visualized hierarchical structure. this approach allows for creating treemap visualizations within areas of arbitrary shape, such as triangles & cir
go5025 2012/05/22
ãƒœãƒãƒŽã‚¤

treemap

ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ

å¯è¦–åŒ–
ãƒªãƒ³ã‚¯
1

ãŠçŸ¥ã‚‰ã›

ã‚‚ã£ã¨èªã‚€

å…¬å¼Twitter

@hatebu
æœ€æ–°ã®äººæ°—ã‚¨ãƒ³ãƒˆãƒªãƒ¼ã®é…ä¿¡

ã‚ãƒ¼ãƒœãƒ¼ãƒ‰ã‚·ãƒ§ãƒ¼ãƒˆã‚«ãƒƒãƒˆä¸€è¦§

jæ¬¡ã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯

kå‰ã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯

lã‚ã¨ã§èªã‚€

eã‚³ãƒ¡ãƒ³ãƒˆä¸€è¦§ã‚’é–‹ã

oãƒšãƒ¼ã‚¸ã‚’é–‹ã

è¨å®šã‚’å¤‰æ›´ã—ã¾ã—ãŸx

ã¯ã¦ãªãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯

ã‚¿ã‚°

é–¢é€£ã‚¿ã‚°ã§çµžã‚Šè¾¼ã‚€ (3)

ãƒœãƒãƒŽã‚¤ã«é–¢ã™ã‚‹go5025ã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯ (2)

ãŠçŸ¥ã‚‰ã›

ä»Šé€±ã®ã¯ã¦ãªãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯æ•°ãƒ©ãƒ³ã‚ãƒ³ã‚°ï¼ˆ2025å¹´1æœˆç¬¬1é€±ï¼‰

ä»Šé€±ã®ã¯ã¦ãªãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯æ•°ãƒ©ãƒ³ã‚ãƒ³ã‚°ï¼ˆ2024å¹´12æœˆç¬¬4é€±ï¼‰

ã€Œã‚ã¨ã§èªã‚€ã€ã‚¿ã‚°ã§æŒ¯ã‚Šè¿”ã‚‹2024å¹´ ã€œä»Šå¹´ã®ã€Œã‚ã¨ã§èªã‚€ã€ã€ä»Šå¹´ã®ã†ã¡ã«ã€œ

å…¬å¼Twitter

ã‚ãƒ¼ãƒœãƒ¼ãƒ‰ã‚·ãƒ§ãƒ¼ãƒˆã‚«ãƒƒãƒˆä¸€è¦§

ã¯ã¦ãªãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯

å…¬å¼Twitter

ã¯ã¦ãªã®ã‚µãƒ¼ãƒ“ã‚¹

ã‚¿ã‚°

é–¢é€£ã‚¿ã‚°ã§çµžã‚Šè¾¼ã‚€ (3)

ãƒœãƒ­ãƒŽã‚¤ã«é–¢ã™ã‚‹go5025ã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯ (2)

ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ TM's Workspace -

voronoi treemap algorithm - information aesthetics

ãŠçŸ¥ã‚‰ã›

ä»Šé€±ã®ã¯ã¦ãªãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯æ•°ãƒ©ãƒ³ã‚­ãƒ³ã‚°ï¼ˆ2025å¹´1æœˆç¬¬1é€±ï¼‰

ä»Šé€±ã®ã¯ã¦ãªãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯æ•°ãƒ©ãƒ³ã‚­ãƒ³ã‚°ï¼ˆ2024å¹´12æœˆç¬¬4é€±ï¼‰

ã€Œã‚ã¨ã§èª­ã‚€ã€ã‚¿ã‚°ã§æŒ¯ã‚Šè¿”ã‚‹2024å¹´ ã€œä»Šå¹´ã®ã€Œã‚ã¨ã§èª­ã‚€ã€ã€ä»Šå¹´ã®ã†ã¡ã«ã€œ

å…¬å¼Twitter

ã‚­ãƒ¼ãƒœãƒ¼ãƒ‰ã‚·ãƒ§ãƒ¼ãƒˆã‚«ãƒƒãƒˆä¸€è¦§

ã¯ã¦ãªãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯

å…¬å¼Twitter

ã¯ã¦ãªã®ã‚µãƒ¼ãƒ“ã‚¹

é–¢é€£ã‚¿ã‚°ã§çµžã‚Šè¾¼ã‚€ (3)

ãƒœãƒãƒŽã‚¤ã«é–¢ã™ã‚‹go5025ã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯ (2)

ãŠçŸ¥ã‚‰ã›

ä»Šé€±ã®ã¯ã¦ãªãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯æ•°ãƒ©ãƒ³ã‚ãƒ³ã‚°ï¼ˆ2025å¹´1æœˆç¬¬1é€±ï¼‰

ä»Šé€±ã®ã¯ã¦ãªãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯æ•°ãƒ©ãƒ³ã‚ãƒ³ã‚°ï¼ˆ2024å¹´12æœˆç¬¬4é€±ï¼‰

ã€Œã‚ã¨ã§èªã‚€ã€ã‚¿ã‚°ã§æŒ¯ã‚Šè¿”ã‚‹2024å¹´ ã€œä»Šå¹´ã®ã€Œã‚ã¨ã§èªã‚€ã€ã€ä»Šå¹´ã®ã†ã¡ã«ã€œ

å…¬å¼Twitter

ã‚ãƒ¼ãƒœãƒ¼ãƒ‰ã‚·ãƒ§ãƒ¼ãƒˆã‚«ãƒƒãƒˆä¸€è¦§

ã¯ã¦ãªãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯

å…¬å¼Twitter

ã¯ã¦ãªã®ã‚µãƒ¼ãƒ“ã‚¹