GeekArticles

C#

A C# implementation of Douglas-Peucker Line Approximation Algorithm

Author: codeproject.com
Category: C#
Comments (0)

DP Line approximation algorithm is a well-known method to approximate 2D lines. It is quite fast, O(nlog_2(n)) for a n-points line and can drastically compress a data curve. Here, a fully OOP implementation is given.

Read More...

Sponsored Links

Read Next: SilverLight Introduction

Related Topics

Article :: Choosing the Right Algorithm in C++

Implementation of XML Information Retrieval by LINQ

Google Translator API v2 Implementation

A macro to create a C++ implementation from a header declaration

Running Delphi Tasks In Threads - Thread Pool Implementation In OTL - An Example Project

Comments

Subscribe via RSS

Subscribe to GeekArticles.com by Email

Enter your email address:

Subscribe in a reader

C#

Sponsored Links