Line simplification algorithm

5 ビュー (過去 30 日間)
marianoc84
marianoc84 2012 年 1 月 21 日
回答済み: Lipi Vora 2019 年 12 月 18 日
I need the following line simplification algorithm:
  • Bellman
  • STTrace
  • TD-TR (modified Douglas-Peucker)
  • OPW-TR (opening window)
  • OPW-SP (opening window with speed error condition)
I've searched on google but, I have just found academic papers that talk about it. Have someone implemented those algorithms or know a repository where i can find it? I need it in Matlab language, but it's not a real problem.
  2 件のコメント
Walter Roberson
Walter Roberson 2012 年 1 月 21 日
It looks to me as if many of those are abbreviations invented for use in a particular paper that is _not_ using the algorithms for line simplification.
marianoc84
marianoc84 2012 年 1 月 21 日
With regard to the last three, I thought the same.
But Bellman and STTrace looks like universal name. Alas if I search for Bellman all results are about well known Bellman-Ford algorithm.
The paper: "Spatio temporal compression techniques for moving point objects" by Meratnia, could resolve my problem, cause all of this algorithm are discussed in that paper, but this paper isn't avaible for free.

サインインしてコメントする。

回答 (1 件)

Lipi Vora
Lipi Vora 2019 年 12 月 18 日
We now implement the Douglas-Peucker line simplification algorithm in MATLAB.

カテゴリ

Help Center および File ExchangeData Type Identification についてさらに検索

タグ

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Translated by