Click here to Skip to main content
Click here to Skip to main content
Articles » Languages » C# » General » Revisions
 
Add your own
alternative version

A C# Implementation of Douglas-Peucker Line Approximation Algorithm

, 6 Jun 2007 CPOL
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.

Revisions


  

Compare Revision Minor Date Status Editor
1 - publicly available No 6-Jun-07 14:31 Available Deeksha Shenoy

License

This article, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

Share

About the Author

CraigSelbert
Web Developer
United States United States
No Biography provided

| Advertise | Privacy | Terms of Use | Mobile
Web04 | 2.8.141223.1 | Last Updated 6 Jun 2007
Article Copyright 2007 by CraigSelbert
Everything else Copyright © CodeProject, 1999-2014
Layout: fixed | fluid