<html xmlns="http://www.w3.org/1999/xhtml"><head></head><body><section><h1>多角線簡略化</h1><p><cite xml:lang="en">Ramer–Douglas–Peucker algorithm - Wikipedia</cite>, <time>2024-04-11T06:46:51.000Z</time>, <time>2024-04-26T06:10:12.598Z</time> <anchor-external xmlns="urn:x-suika-fam-cx:markup:suikawiki:0:9:" a0:resScheme="URI" xmlns:a0="urn:x-suika-fam-cx:markup:suikawiki:0:9:" a0:resParameter="https://en.wikipedia.org/wiki/Ramer%E2%80%93Douglas%E2%80%93Peucker_algorithm">https://en.wikipedia.org/wiki/Ramer%E2%80%93Douglas%E2%80%93Peucker_algorithm</anchor-external></p><p><anchor-end xmlns="urn:x-suika-fam-cx:markup:suikawiki:0:9:" a0:anchor="4" xmlns:a0="urn:x-suika-fam-cx:markup:suikawiki:0:9:">[4]</anchor-end> <cite xml:lang="en">Ramer–Douglas–Peucker Algorithm – Siguniang's Blog</cite>, <time>2024-04-26T06:09:49.000Z</time> <anchor-external xmlns="urn:x-suika-fam-cx:markup:suikawiki:0:9:" a0:resScheme="URI" xmlns:a0="urn:x-suika-fam-cx:markup:suikawiki:0:9:" a0:resParameter="https://siguniang.wordpress.com/2012/07/16/ramer-douglas-peucker-algorithm/">https://siguniang.wordpress.com/2012/07/16/ramer-douglas-peucker-algorithm/</anchor-external></p><p><anchor-end xmlns="urn:x-suika-fam-cx:markup:suikawiki:0:9:" a0:anchor="3" xmlns:a0="urn:x-suika-fam-cx:markup:suikawiki:0:9:">[3]</anchor-end> 
<cite xml:lang="ja">TrailNote : トラックポイントを間引くアルゴリズム</cite>, <time>2024-04-26T06:09:00.000Z</time> <anchor-external xmlns="urn:x-suika-fam-cx:markup:suikawiki:0:9:" a0:resScheme="URI" xmlns:a0="urn:x-suika-fam-cx:markup:suikawiki:0:9:" a0:resParameter="https://www.trail-note.net/tech/thinout/">https://www.trail-note.net/tech/thinout/</anchor-external></p><p><anchor-end xmlns="urn:x-suika-fam-cx:markup:suikawiki:0:9:" a0:anchor="6" xmlns:a0="urn:x-suika-fam-cx:markup:suikawiki:0:9:">[6]</anchor-end> 
<cite>Matsup's blog: GPSのログを間引く(折れ線を間引く)</cite>, <time>2024-04-08T12:56:04.000Z</time>, <time>2024-04-26T06:29:38.312Z</time> <anchor-external xmlns="urn:x-suika-fam-cx:markup:suikawiki:0:9:" a0:resScheme="URI" xmlns:a0="urn:x-suika-fam-cx:markup:suikawiki:0:9:" a0:resParameter="http://matsup.blogspot.com/2011/03/gps.html">http://matsup.blogspot.com/2011/03/gps.html</anchor-external></p><p><anchor-end xmlns="urn:x-suika-fam-cx:markup:suikawiki:0:9:" a0:anchor="2" xmlns:a0="urn:x-suika-fam-cx:markup:suikawiki:0:9:">[2]</anchor-end> 
<cite xml:lang="ja-jp">折れ線を間引く(Ramer-Douglas-Peuckerアルゴリズム) - 330k info</cite>, <time>2024-04-23T17:42:35.000Z</time>, <time>2024-04-26T06:07:30.085Z</time> <anchor-external xmlns="urn:x-suika-fam-cx:markup:suikawiki:0:9:" a0:resScheme="URI" xmlns:a0="urn:x-suika-fam-cx:markup:suikawiki:0:9:" a0:resParameter="https://www.330k.info/essay/oresenwomabiku/">https://www.330k.info/essay/oresenwomabiku/</anchor-external></p><p><anchor-end xmlns="urn:x-suika-fam-cx:markup:suikawiki:0:9:" a0:anchor="1" xmlns:a0="urn:x-suika-fam-cx:markup:suikawiki:0:9:">[1]</anchor-end> 
<cite xml:lang="ja-jp">トラック間引きアルゴリズムの比較 - 330k info</cite>, <time>2024-04-23T17:42:35.000Z</time>, <time>2024-04-26T05:49:18.394Z</time> <anchor-external xmlns="urn:x-suika-fam-cx:markup:suikawiki:0:9:" a0:resScheme="URI" xmlns:a0="urn:x-suika-fam-cx:markup:suikawiki:0:9:" a0:resParameter="https://www.330k.info/essay/comparison_of_track_simplify_algorithms/">https://www.330k.info/essay/comparison_of_track_simplify_algorithms/</anchor-external></p><figure class="quote"><figcaption><anchor-end xmlns="urn:x-suika-fam-cx:markup:suikawiki:0:9:" a0:anchor="86" xmlns:a0="urn:x-suika-fam-cx:markup:suikawiki:0:9:">[86]</anchor-end> <cite>GPXデータを<anchor xmlns="urn:x-suika-fam-cx:markup:suikawiki:0:9:">簡略化</anchor> - 330k.info</cite>,
<time>2016-06-01 20:28:09 +09:00</time>
<anchor-external xmlns="urn:x-suika-fam-cx:markup:suikawiki:0:9:" a0:resScheme="URI" xmlns:a0="urn:x-suika-fam-cx:markup:suikawiki:0:9:" a0:resParameter="http://www.330k.info/software/simplify_gpx">http://www.330k.info/software/simplify_gpx</anchor-external></figcaption><blockquote><p>自転車ツーリング中は事前にGoogle MapsとGMapToGPXで作っておいた走行ルートをGPXファイルにし、</p><p>AndroidのRMapsや地図ロイドに読み込ませて走行ルートを確認しているのだが、</p><p>GPXファイルに余分な要素があると、処理に時間がかかってしまう(あまりに重いと処理できないこともある)。</p><p>そこでtrkpt要素の子要素(eleやcmt、timeなど)を根こそぎ削除し、lat属性とlon属性のみを残すスクリプトを作成した。</p><p>また、<strong>[</strong>Mathematica<strong>]</strong> 折れ線を間引くのアルゴリズム(Douglas-Peucker)を用いて、GPSログ中のポイントを間引く機能も実装してみた。</p></blockquote></figure></section><section><h1>境界線簡略化</h1><p><anchor-end xmlns="urn:x-suika-fam-cx:markup:suikawiki:0:9:" a0:anchor="5" xmlns:a0="urn:x-suika-fam-cx:markup:suikawiki:0:9:">[5]</anchor-end> <cite xml:lang="ja">研39-3.4-03田中章司郎.indd - kenkyu2016390303.pdf</cite>, <time>2024-04-26T06:19:39.000Z</time> <anchor-external xmlns="urn:x-suika-fam-cx:markup:suikawiki:0:9:" a0:resScheme="URI" xmlns:a0="urn:x-suika-fam-cx:markup:suikawiki:0:9:" a0:resParameter="http://www.shojiro-tanaka.net/images/kenkyu2016390303.pdf">http://www.shojiro-tanaka.net/images/kenkyu2016390303.pdf</anchor-external></p></section><section><h1>メモ</h1></section></body></html>