<?xml version="1.0" encoding="utf-8"?>
<oembed><version>1.0</version><provider_name>Camdemy1.0</provider_name><provider_url>http://media.usc.edu.tw</provider_url><title>雜湊+遞迴: 四元樹(Quadtrees)</title><description></description><author_name></author_name><author_url>http://media.usc.edu.tw/user/</author_url><thumbnail_url>http://media.usc.edu.tw/sysdata/doc/8/85d3087899a83d06/thumb_l.jpg</thumbnail_url><thumbnail_height>360</thumbnail_height><thumbnail_width>640</thumbnail_width><html>&amp;lt;iframe width='720' height='405' id='ccShare627' frameborder='0'  src='http://media.usc.edu.tw/media/e/627' allowfullscreen&amp;gt;&amp;lt;/iframe&amp;gt;</html><type>video</type><width>720</width><height>405</height><duration>1:05:52</duration><index><item_1><title>四元樹Quadtrees</title><time>0</time><indent>0</indent><sn>1</sn></item_1><item_2><title>Observation 1: empty + some  =  some</title><time>182750</time><indent>0</indent><sn>2</sn></item_2><item_3><title>Observation 2: filled + any  =  filled</title><time>230700</time><indent>0</indent><sn>3</sn></item_3><item_4><title>Observation 3: preorder of tree representation</title><time>260000</time><indent>0</indent><sn>4</sn></item_4><item_5><title>Observation 4: 9 combinations of e, f, p</title><time>482000</time><indent>0</indent><sn>5</sn></item_5><item_6><title>Observation 5: how to hash 9 combinations</title><time>677850</time><indent>0</indent><sn>6</sn></item_6><item_7><title>Observation 6: how to map e, f, p</title><time>824100</time><indent>0</indent><sn>7</sn></item_7><item_8><title>Design Issue 1: Hash to 9 combinations</title><time>872800</time><indent>0</indent><sn>8</sn></item_8><item_9><title>Design Issue 2: Hash to 9 combinations</title><time>1042100</time><indent>0</indent><sn>9</sn></item_9><item_10><title>Design Issue 3: fill pixels</title><time>1062400</time><indent>0</indent><sn>10</sn></item_10><item_11><title>Design Issue 4: skip a subtree</title><time>1145450</time><indent>0</indent><sn>11</sn></item_11><item_12><title>Design Issue 5: scan pixels within a subtree</title><time>1278950</time><indent>0</indent><sn>12</sn></item_12><item_13><title>Coding Part 1: hash to 9 combinations</title><time>1375000</time><indent>0</indent><sn>13</sn></item_13><item_14><title>Coding Part 2: scan, skip, fill</title><time>2272950</time><indent>0</indent><sn>14</sn></item_14></index><resolution><playtype>fs</playtype><subtype></subtype><src>1280x720</src><mp4>720x404</mp4><mp4_hd>1280x720</mp4_hd><mp4_4k></mp4_4k><mp4_1920></mp4_1920><mp4_src></mp4_src><mp4_base></mp4_base></resolution><base_image><thumb>http://media.usc.edu.tw/sysdata/doc/8/85d3087899a83d06/thumb.jpg</thumb><cover>http://media.usc.edu.tw/sysdata/doc/8/85d3087899a83d06/cover.jpg</cover><storyboard>http://media.usc.edu.tw/sysdata/doc/8/85d3087899a83d06/video/thumbs/storyboard.jpg</storyboard></base_image><srcFrom></srcFrom><base_url>http://media.usc.edu.tw/sysdata/doc/8/85d3087899a83d06</base_url><status>1</status></oembed>
