[B! algorithm] sylph01ã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯

sylph01 id:sylph01

algorithmã«é–¢ã™ã‚‹sylph01ã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯ (16)

${{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}}

ãƒ–ãƒ«ãƒ¼ãƒ ãƒ•ã‚£ãƒ«ã‚¿ - Wikipedia
ã“ã®é …ç›®ã§ã¯ã€ç¢ºçŽ‡çš„ãƒ‡ãƒ¼ã‚¿æ§‹é€ ã«ã¤ã„ã¦èª¬æ˜Žã—ã¦ã„ã¾ã™ã€‚ç”»åƒã«ã¼ã‹ã—åŠ¹æžœã‚’ä»˜åŠ ã™ã‚‹ç”»åƒãƒ•ã‚£ãƒ«ã‚¿ã«ã¤ã„ã¦ã¯ã€Œå·ç€¬ã®ãƒ–ãƒ«ãƒ¼ãƒ ãƒ•ã‚£ãƒ«ã‚¿ãƒ¼ã€ã‚’ã”è¦§ãã ã•ã„ã€‚ ãƒ–ãƒ«ãƒ¼ãƒ ãƒ•ã‚£ãƒ«ã‚¿ï¼ˆè‹±èªž: Bloom filterï¼‰ã¯ã€1970å¹´ã« Burton H. Bloom ãŒè€ƒæ¡ˆã—ãŸç©ºé–“åŠ¹çŽ‡ã®è‰¯ã„ç¢ºçŽ‡çš„ãƒ‡ãƒ¼ã‚¿æ§‹é€ ã§ã‚ã‚Šã€ã‚ã‚‹ãƒ‡ãƒ¼ã‚¿ãŒé›†åˆã®è¦ç´ ã§ã‚ã‚‹ï¼ˆé›†åˆã«å«ã¾ã‚Œã¦ã„ã‚‹ï¼‰ã‹ã©ã†ã‹ã®åˆ¤å®šã«ä½¿ã‚ã‚Œã‚‹ã€‚ãŸã ã—åˆ¤å®šã¯æ£ç¢ºã§ã¯ãªãã¦ã€å«ã¾ã‚Œã¦ã„ãªã„ã®ã«å«ã¾ã‚Œã¦ã„ã‚‹ã¨èª¤ã£ã¦åˆ¤å®šã™ã‚‹ã“ã¨å½é™½æ€§ï¼ˆfalse positiveï¼‰ã®å¯èƒ½æ€§ãŒã‚ã‚‹ã€‚ã—ã‹ã—å«ã¾ã‚Œã¦ã„ã‚‹ã‚‚ã®ã‚’å«ã¾ã‚Œã¦ã„ãªã„ã¨èª¤åˆ¤å®šã™ã‚‹ã“ã¨å½é™°æ€§ï¼ˆfalse negativeï¼‰ã¯ãªã„ã€‚ãªãŠé›†åˆã«è¦ç´ ã‚’è¿½åŠ ã™ã‚‹ã“ã¨ã¯ã§ãã‚‹ãŒã€é›†åˆã‹ã‚‰è¦ç´ ã‚’å‰Šé™¤ã™ã‚‹ã“ã¨ã¯ã§ããªã„ï¼ˆãŸã ã—ã€æ‹¡å¼µã‚’ã—ãŸ counting filter ã§ã‚ã‚Œã°å‰Šé™¤ã‚‚ã§ãã‚‹ï¼‰ã€‚é›†åˆã«è¦ç´ ã‚’è¿½åŠ ã—ã¦ã„ãã«ã¤ã‚Œã¦å½é™½æ€§ã®
sylph01 2022/01/29
algorithm
ãƒªãƒ³ã‚¯
ãƒˆãƒ©ã‚¤ (ãƒ‡ãƒ¼ã‚¿æ§‹é€ ) - Wikipedia
"A", "to", "tea", "ted", "ten", "i", "in", "inn" ã¨ã„ã†ã‚ãƒ¼ç¾¤ã«ã‚ˆã‚‹ãƒˆãƒ©ã‚¤æœ¨ ãƒˆãƒ©ã‚¤æœ¨ï¼ˆè‹±: trieï¼‰ã‚„ãƒ—ãƒ¬ãƒ•ã‚£ãƒƒã‚¯ã‚¹æœ¨ï¼ˆè‹±: prefix treeï¼‰ã¨ã¯ã€é †åºä»˜ãæœ¨ã®ä¸€ç¨®ã€‚ã‚ã‚‹ãƒŽãƒ¼ãƒ‰ã®é…ä¸‹ã®å…¨ãƒŽãƒ¼ãƒ‰ã¯ã€è‡ªèº«ã«å¯¾å¿œã™ã‚‹æ–‡å—åˆ—ã«å…±é€šã™ã‚‹ãƒ—ãƒ¬ãƒ•ã‚£ãƒƒã‚¯ã‚¹ï¼ˆæŽ¥é éƒ¨ï¼‰ãŒã‚ã‚Šã€ãƒ«ãƒ¼ãƒˆï¼ˆæ ¹ï¼‰ã«ã¯ç©ºã®æ–‡å—åˆ—ãŒå¯¾å¿œã—ã¦ã„ã‚‹ã€‚å€¤ã¯ä¸€èˆ¬ã«å…¨ãƒŽãƒ¼ãƒ‰ã«å¯¾å¿œã—ã¦å˜åœ¨ã™ã‚‹ã‚ã‘ã§ã¯ãªãã€æœ«ç«¯ãƒŽãƒ¼ãƒ‰ã‚„ä¸€éƒ¨ã®ä¸é–“ãƒŽãƒ¼ãƒ‰ã ã‘ãŒã‚ãƒ¼ã«å¯¾å¿œã—ãŸå€¤ã‚’æ ¼ç´ã—ã¦ã„ã‚‹ã€‚2åˆ†æŽ¢ç´¢æœ¨ã¨ç•°ãªã‚Šã€å„ãƒŽãƒ¼ãƒ‰ã«å€‹ã€…ã®ã‚ãƒ¼ãŒæ ¼ç´ã•ã‚Œã‚‹ã®ã§ã¯ãªãã€æœ¨æ§‹é€ ä¸Šã®ãƒŽãƒ¼ãƒ‰ã®ä½ç½®ã¨ã‚ãƒ¼ãŒå¯¾å¿œã—ã¦ã„ã‚‹ã€‚ ã‚ãƒ¼ãŒæ–‡å—åˆ—ã§ã‚ã‚‹é€£æƒ³é…åˆ—ã®å®Ÿè£…æ§‹é€ ã¨ã—ã¦ã‚‚ä½¿ã‚ã‚Œã‚‹ã€‚å³å›³ã®ä¾‹ã§ã¯ã€ãƒŽãƒ¼ãƒ‰ã‚’è¡¨ã™ä¸¸ã®ä¸ã«ã‚ãƒ¼ãŒæ›¸ã‹ã‚Œã€é€£æƒ³ã•ã‚Œã‚‹å€¤ãŒãã®ä¸‹ã«æ›¸ã‹ã‚Œã¦ã„ã‚‹ã€‚å€¤ãŒæ›¸ã‹ã‚Œã¦ã„ãªã„ãƒŽãƒ¼ãƒ‰ã¯ã‚ãƒ¼æ–‡å—åˆ—ã®é€”ä¸ã¾ã§ã«ã—ã‹å¯¾å¿œã—ã¦ã„ãªã„ã€‚å„è‹±å˜èªž
sylph01 2022/01/29
algorithm
ãƒªãƒ³ã‚¯
ä¸‰åˆ†æŽ¢ç´¢æœ¨ - Wikipedia
ä¸‰åˆ†æŽ¢ç´¢æœ¨ï¼ˆã•ã‚“ã¶ã‚“ãŸã‚“ã•ããŽã€è‹±: ternary search treeï¼‰ã¯ã€ãƒˆãƒ©ã‚¤æœ¨ã®å„ãƒŽãƒ¼ãƒ‰ã‚’äºŒåˆ†æŽ¢ç´¢æœ¨ã¨ã—ã¦è¡¨ç¾ã—ãŸãƒ‡ãƒ¼ã‚¿æ§‹é€ ã§ã‚ã‚‹ã€‚å„ãƒŽãƒ¼ãƒ‰ã¯æ–‡å—åˆ—ä¸ã®æ–‡å—ã¨ä»¥ä¸‹ã®ä¸‰ã¤ã®åãƒŽãƒ¼ãƒ‰ã‚’æŒã¤ã€‚ ãã®æ–‡å—ã®ä»£ã‚ã‚Šã«ã€ã‚ˆã‚Šå°ã•ãªæ–‡å—ã‚’æŒ‡ã™å·¦ãƒŽãƒ¼ãƒ‰ ãã®æ–‡å—ã®ä»£ã‚ã‚Šã«ã€ã‚ˆã‚Šå¤§ããªæ–‡å—ã‚’æŒ‡ã™å³ãƒŽãƒ¼ãƒ‰ ãã®æ–‡å—ã®æ¬¡ã®æ–‡å—ã‚’æŒ‡ã™ä¸å¤®ãƒŽãƒ¼ãƒ‰ ä»–ã®ãƒˆãƒ©ã‚¤æœ¨æ§‹é€ ã¨åŒã˜ãã€ä¸‰åˆ†æŽ¢ç´¢æœ¨ã®å„ãƒŽãƒ¼ãƒ‰ã¯æ ¼ç´ã•ã‚ŒãŸæ–‡å—åˆ—ã®æŽ¥é è¾žã«å¯¾å¿œã—ã¦ã„ã‚‹ã€‚ä¸å¤®ãƒŽãƒ¼ãƒ‰ã«æ ¼ç´ã•ã‚ŒãŸæœ¨ã¯ã€ãã“ã«è‡³ã‚‹ã¾ã§ã®ãƒŽãƒ¼ãƒ‰ã‚’å…±é€šæŽ¥é è¾žã¨ã—ã¦æŒã¤ã€‚ c / | \ a u h | | | \ t t e u / / | / | s p e i s ä¸Šè¨˜ã®ä¸‰åˆ†æŽ¢ç´¢æœ¨ã¯ "as", "at", "cup", "cute", "he", "i", "us" ãŒå€¤ã¨ã—ã¦æ ¼ç´ã•ã‚Œã¦ã„ã‚‹ã€‚ä¸‰åˆ†æŽ¢ç´¢æœ¨ã‹ã‚‰å€¤ã‚’å–å¾—ã™ã‚‹ã«ã¯æ¬¡ã®ã‚ˆã†ãªæ“ä½œã‚’è¡Œã†ã€‚ é ‚ç‚¹ãƒŽãƒ¼ãƒ‰ã‹ã‚‰
sylph01 2022/01/29
algorithm
ãƒªãƒ³ã‚¯
Evaluation strategy - Wikipedia
In a programming language, an evaluation strategy is a set of rules for evaluating expressions.[1] The term is often used to refer to the more specific notion of a parameter-passing strategy[2] that defines the kind of value that is passed to the function for each parameter (the binding strategy)[3] and whether to evaluate the parameters of a function call, and if so in what order (the evaluation
sylph01 2022/01/29
algorithm
ãƒªãƒ³ã‚¯
Data Structures in JavaScript: Arrays, HashMaps, and Lists
sylph01 2022/01/29
algorithm
ãƒªãƒ³ã‚¯
BBPã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ
ã¯ã˜ã‚ã« å††å‘¨çŽ‡ã®å°æ•°ç‚¹ä»¥ä¸‹dæ¡ç›®ã‚’æ±‚ã‚ã‚‹ãŸã‚ã«ã¯ã€1,2,3,...,d-1æ¡ç›®ã‚’è¨ˆç®—ã—ãªã‘ã‚Œã°ãªã‚‰ãªã„ã¨è€ƒãˆã‚‰ã‚Œã¦ãã¾ã—ãŸã€‚ã¨ã“ã‚ãŒ1995å¹´ã«Simon Plouffe(ãƒ—ãƒ©ã‚¦ãƒ•)ã«ã‚ˆã‚Šç™ºè¦‹ã•ã‚ŒãŸå…¬å¼ã‚’ç”¨ã„ã‚‹ã¨ã€å††å‘¨çŽ‡ã®16é€²æ•°è¡¨ç¤ºã®dæ¡ç›®ã‚’ãƒ”ãƒ³ãƒã‚¤ãƒ³ãƒˆã«æ±‚ã‚ã‚‰ã‚Œã‚‹ã“ã¨ãŒåˆ†ã‹ã‚Šã¾ã—ãŸã€‚ã“ã®å…¬å¼ã¯ã€ä»Šæ—¥BBP(Bailey-Borwein-Plouffe)å…¬å¼ã¨å‘¼ã°ã‚Œã¦ã„ã¾ã™ã€‚å…¬å¼ã‚’æ¬¡ã«ç¤ºã—ã¾ã™ã€‚ ã¾ãšã€ã¨ãŠãã¾ã™ã€‚xã®å°æ•°éƒ¨åˆ†ã‚’{x}ã¨ã—ã¾ã™ã¨ã€å††å‘¨çŽ‡ã®å°æ•°ç‚¹ä»¥ä¸‹d+1æ¡ç›®ãŒçŸ¥ã‚ŠãŸã„ã¨ãã¯ã€{16dÏ€}ã‚’æ±‚ã‚ã‚Œã°ã‚ˆã„ã“ã¨ãŒåˆ†ã‹ã‚Šã¾ã™ã€‚BBPå…¬å¼ã‚’ç”¨ã„ã‚‹ã¨ã€{16dÏ€}ã¯ã€ ã¨è¡¨ã•ã‚Œã¾ã™ã€‚æœ€å¾Œã«4ã‚’è¶³ã—ã¦ã„ã‚‹ã®ã¯ã€ä¾‹ãˆã°ã€ãŸã¾ãŸã¾{S1}=0.00111ã€{S4}=0.98891ã€{S5}=0.89991ã€{S6}=0.90361ã€ã¨ãªã£ãŸã¨ãã€æœ¬æ¥4S1-2S4-S5-S6ã¯æ£ã®æ•°ã«
sylph01 2019/03/15
algorithm
ãƒªãƒ³ã‚¯
Reddit - Dive into anything
The subreddit covers various game development aspects, including programming, design, writing, art, game jams, postmortems, and marketing. It serves as a hub for game creators to discuss and share their insights, experiences, and expertise in the industry. So today I'm going to be a little different and talk about one technical aspect of my game TinyKeep, that is random procedural dungeon generati
sylph01 2017/11/16
algorithm
ãƒªãƒ³ã‚¯
Fowlerâ€“Nollâ€“Vo hash function - Wikipedia
Fowlerâ€“Nollâ€“Vo (or FNV) is a non-cryptographic hash function created by Glenn Fowler, Landon Curt Noll, and Kiem-Phong Vo. The basis of the FNV hash algorithm was taken from an idea sent as reviewer comments to the IEEE POSIX P1003.2 committee by Glenn Fowler and Phong Vo in 1991. In a subsequent ballot round, Landon Curt Noll improved on their algorithm. In an em ail message to Landon, they named
sylph01 2017/09/13
algorithm
ãƒªãƒ³ã‚¯
Token bucket - Wikipedia
The token bucket is an algorithm used in packet-switched and telecommunications networks. It can be used to check that data transmissions, in the form of packets, conform to defined limits on bandwidth and burstiness (a measure of the unevenness or variations in the traffic flow). It can also be used as a scheduling algorithm to determine the timing of transmissions that will comply with the limit
sylph01 2017/06/14
algorithm
ãƒªãƒ³ã‚¯
Amazonã®æŽ¨è–¦ã‚·ã‚¹ãƒ†ãƒ ã®20å¹´
IEEE Internet Computingã®2017å¹´5ãƒ»6æœˆå·ã« "Two Decades of Recommender Systems at Amazon.com" ã¨ã„ã†è¨˜äº‹ãŒæŽ²è¼‰ã•ã‚ŒãŸã€‚ 2003å¹´ã«åŒèªŒã«æŽ²è¼‰ã•ã‚ŒãŸãƒ¬ãƒãƒ¼ãƒˆ "Amazon.com Recommendations: It em-to-It em Collaborative Filtering" ãŒ Test of Timeã€ã¤ã¾ã‚Šã€Žæ™‚ä»£ãŒè¨¼æ˜Žã—ãŸã§è³žã€ã‚’å—è³žã—ãŸã“ã¨ã‚’ã†ã‘ã¦ã®ç‰¹åˆ¥è¨˜äº‹ã‚‰ã—ã„ 1ã€‚ ã€Œã“ã®å•†å“ã‚’è²·ã£ãŸäººã¯ã“ã‚“ãªå•†å“ã‚‚è²·ã£ã¦ã„ã¾ã™ã€ã¨ã„ã†æŽ¨è–¦ã§æœ‰åãªAmazonãŒ1998å¹´ã«ãã®åœŸå°ã¨ãªã‚‹ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã®ç‰¹è¨±ã‚’å‡ºé¡˜ã—ã¦ã‹ã‚‰20å¹´ã€å½¼ã‚‰ãŒ æŽ¨è–¦ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã‚’ã©ã®ã‚ˆã†ãªè¦–ç‚¹ã§æ”¹è‰¯ã—ã¦ããŸã®ã‹ ä»Šã€ã©ã®ã‚ˆã†ãªæœªæ¥ã‚’æƒ³åƒã™ã‚‹ã®ã‹ ãã®ä¸€ç«¯ã‚’çŸ¥ã‚‹ã“ã¨ãŒã§ãã‚‹è¨˜äº‹ã ã£ãŸã€‚ ã‚¢ã‚¤ãƒ†ãƒ ãƒ™ãƒ¼ã‚¹å”èª¿ãƒ•ã‚£ãƒ«ã‚¿ãƒªãƒ³ã‚° 20å¹´å‰ã‚‚
sylph01 2017/06/12
amazon

algorithm
ãƒªãƒ³ã‚¯
What's new in purely functional data structures since Okasaki?
Since Chris Okasaki's 1998 book "Purely functional data structures", I haven't seen too many new exciting purely functional data structures appear; I can name just a few: IntMap (also invented by Okasaki in 1998, but not present in that book) Finger trees (and their generalization over monoids) There are also some interesting ways of implementing already known datastructures, such as using "nested
sylph01 2017/05/11
functional

algorithm
ãƒªãƒ³ã‚¯
H.264ã®ç§˜å¯† | POSTD
(ç·¨æ³¨ï¼š2020/08/18ã€ã„ãŸã ã„ãŸãƒ•ã‚£ãƒ¼ãƒ‰ãƒãƒƒã‚¯ã‚’ã‚‚ã¨ã«è¨˜äº‹ã‚’ä¿®æ£ã„ãŸã—ã¾ã—ãŸã€‚) (2016/12/11ã€ã„ãŸã ãã¾ã—ãŸãƒ•ã‚£ãƒ¼ãƒ‰ãƒãƒƒã‚¯ã‚’ã‚‚ã¨ã«ç¿»è¨³ã‚’ä¿®æ£ã„ãŸã—ã¾ã—ãŸã€‚) H.264ã¯ã€å‹•ç”»åœ§ç¸®ã‚³ãƒ¼ãƒ‡ãƒƒã‚¯ã®æ¨™æº–è¦æ ¼ã§ã™ã€‚ãƒãƒƒãƒˆä¸Šã®å‹•ç”»ã€Blu-rayã€ã‚¹ãƒžãƒ›ã€ã‚»ã‚ãƒ¥ãƒªãƒ†ã‚£ã‚«ãƒ¡ãƒ©ã€ãƒ‰ãƒãƒ¼ãƒ³ãªã©ãªã©ã€ä»Šã‚„ã‚ã‚‰ã‚†ã‚‹ã¨ã“ã‚ã§H.264ãŒä½¿ã‚ã‚Œã¦ã„ã¾ã™ã€‚ H.264ã¯æ³¨ç›®ã™ã¹ãæŠ€è¡“ã®ã²ã¨ã¤ã§ã™ã€‚ãŸã£ãŸã²ã¨ã¤ã®ç›®æ¨™ã€ã¤ã¾ã‚Šãƒ•ãƒ«ãƒ¢ãƒ¼ã‚·ãƒ§ãƒ³ãƒ“ãƒ‡ã‚ªã®é€ä¿¡ã«è¦ã™ã‚‹ãƒãƒƒãƒˆãƒ¯ãƒ¼ã‚¯å¸¯åŸŸã‚’å‰Šæ¸›ã™ã‚‹ã“ã¨ã‚’ç›®æŒ‡ã—ãŸ30å¹´ä»¥ä¸Šã®åŠªåŠ›ã®çµæ™¶ãªã®ã§ã™ã€‚ æŠ€è¡“çš„ãªé¢ã§ã‚‚ã€H.264ã¯ã¨ã¦ã‚‚èˆˆå‘³æ·±ã„è¦æ ¼ã§ã™ã€‚ã“ã®è¨˜äº‹ã§ã¯ã€ãã®ä¸€éƒ¨ã«ã¤ã„ã¦æ¦‚è¦ãƒ¬ãƒ™ãƒ«ã§ã®çŸ¥è˜ã‚’å¾—ã‚‰ã‚Œã‚‹ã“ã¨ã§ã—ã‚‡ã†ã€‚ã‚ã¾ã‚Šè¤‡é›‘ã ã¨æ„Ÿã˜ã•ã›ãªã„ã‚ˆã†ã«ã™ã‚‹ã¤ã‚‚ã‚Šã§ã™ã€‚ä»Šå›žãŠã¯ãªã—ã™ã‚‹æ¦‚å¿µã®å¤šãã¯å‹•ç”»åœ§ç¸®å…¨èˆ¬ã«ã‚ã¦ã¯ã¾ã‚‹ã‚‚ã®ã§ã‚ã‚Šã€H.264ã«é™ã£ãŸã‚‚ã®ã§ã¯ã‚ã‚Šã¾ã›ã‚“
sylph01 2016/12/02
algorithm
ãƒªãƒ³ã‚¯
éºä¼çš„FMéŸ³æº
éºä¼çš„ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã‚’ä½¿ã£ã¦äººé–“ãŒãƒ‘ãƒ©ãƒ¡ãƒ¼ã‚¿ã‚’èª¿æ•´ã™ã‚‹äº‹ãªãFMéŸ³æºã‹ã‚‰æ„å›³ã—ãŸéŸ³è‰²ã®éŸ³ã‚’å‡ºã™æ‰‹æ³•ã‚’è§£èª¬ã—ã¾ã™ https://github.com/Fadis/genetic_fm è¿½è¨˜: ç™ºè¡¨ã®å‹•ç”»ã‚’ç”¨æ„ã—ã¾ã—ãŸ https://www.youtube.com/watch?v=oJy0g0mt8LA
sylph01 2016/10/11
algorithm

sound
ãƒªãƒ³ã‚¯
Generating fantasy maps
mewo2.com is the website of Martin O'Leary artist, designer, teacher, researcher These are some notes on how I generate the maps for my Twitter bot @unchartedatlas, which is based on a generator I originally produced during NaNoGenMo 2015. There's JavaScript code for the generator on Github here, and the original messy Python generator code can be seen here. You may also be interested in this comp
sylph01 2016/08/18
algorithm

fantasy

github
ãƒªãƒ³ã‚¯
Connected-component labeling - Wikipedia
Connected-component labeling (CCL), connected-component analysis (CCA), blob extraction, region labeling, blob discovery, or region extraction is an algorithmic application of graph theory, where subsets of connected components are uniquely labeled based on a given heuristic. Connected-component labeling is not to be confused with segmentation. Connected-component labeling is used in computer visi
sylph01 2011/06/07
math

algorithm
ãƒªãƒ³ã‚¯
kdæœ¨ - Wikipedia
3æ¬¡å…ƒã®kdæœ¨ã€‚æ ¹ã‚»ãƒ«ï¼ˆç™½ï¼‰ã‚’ã¾ãš2ã¤ã®éƒ¨åˆ†ã‚»ãƒ«ã«åˆ†å‰²ï¼ˆèµ¤ï¼‰ã—ã€ãã‚Œãžã‚Œã‚’ã•ã‚‰ã«2ã¤ã«åˆ†å‰²ï¼ˆç·‘ï¼‰ã—ã¦ã„ã‚‹ã€‚æœ€å¾Œã«4ã¤ã®ã‚»ãƒ«ãã‚Œãžã‚Œã‚’2ã¤ã«åˆ†å‰²ï¼ˆé’ï¼‰ã—ã¦ã„ã‚‹ã€‚ãã‚Œä»¥ä¸Šã®åˆ†å‰²ã¯ã•ã‚Œã¦ã„ãªã„ã®ã§ã€æœ€çµ‚çš„ã«ã§ããŸ8ã¤ã®ã‚»ãƒ«ã‚’è‘‰ã‚»ãƒ«ã¨å‘¼ã¶ã€‚é»„è‰²ã®çƒã¯æœ¨ã®é ‚ç‚¹ã‚’è¡¨ã—ã¦ã„ã‚‹ã€‚ kdæœ¨ï¼ˆè‹±: kd-tree, k-dimensional treeï¼‰ã¯ã€kæ¬¡å…ƒã®ãƒ¦ãƒ¼ã‚¯ãƒªãƒƒãƒ‰ç©ºé–“ã«ã‚ã‚‹ç‚¹ã‚’åˆ†é¡žã™ã‚‹ç©ºé–“åˆ†å‰²ãƒ‡ãƒ¼ã‚¿æ§‹é€ ã§ã‚ã‚‹ã€‚kdæœ¨ã¯ã€å¤šæ¬¡å…ƒæŽ¢ç´¢éµã‚’ä½¿ã£ãŸæŽ¢ç´¢ï¼ˆä¾‹ãˆã°ã€ç¯„å›²æŽ¢ç´¢ã‚„æœ€è¿‘å‚æŽ¢ç´¢ï¼‰ãªã©ã®ç”¨é€”ã«ä½¿ã‚ã‚Œã‚‹ãƒ‡ãƒ¼ã‚¿æ§‹é€ ã§ã‚ã‚‹ã€‚kdæœ¨ã¯BSPæœ¨ã®ç‰¹æ®Šã‚±ãƒ¼ã‚¹ã§ã‚ã‚‹ã€‚ kdæœ¨ã¯ã€åº§æ¨™è»¸ã®1ã¤ã«åž‚ç›´ãªå¹³é¢ã ã‘ã‚’ä½¿ã£ã¦åˆ†å‰²ã‚’è¡Œã†ã€‚BSPæœ¨ã§ã¯åˆ†å‰²å¹³é¢ã®è§’åº¦ã¯ä»»æ„ã§ã‚ã‚‹ã€‚ã•ã‚‰ã«ä¸€èˆ¬çš„ã«ã¯ã€kdæœ¨ã®æ ¹ãƒŽãƒ¼ãƒ‰ã‹ã‚‰è‘‰ãƒŽãƒ¼ãƒ‰ã¾ã§ã®å„ãƒŽãƒ¼ãƒ‰ã«ã¯1ã¤ã®ç‚¹ãŒæ ¼ç´ã•ã‚Œã‚‹[1]ã€‚ã“ã®ç‚¹ã‚‚BSPæœ¨ã¨ã¯ç•°ãªã‚Šã€BSPæœ¨ã§ã¯è‘‰ãƒŽãƒ¼ãƒ‰ã®ã¿ãŒç‚¹ï¼ˆã¾
sylph01 2011/01/31
algorithm
ãƒªãƒ³ã‚¯
1