Click here to Skip to main content
15,881,709 members
Articles / Programming Languages / C#

A C# Implementation of Douglas-Peucker Line Approximation Algorithm

Rate me:
Please Sign up or sign in to vote.
4.73/5 (24 votes)
6 Jun 2007MIT 156.3K   3.5K   60  
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.

Microsoft Visual Studio Solution File, Format Version 9.00
# Visual Studio 2005
Project("{FAE04EC0-301F-11D3-BF4B-00C04F79EFBC}") = "GIS", "GIS.csproj", "{BBA9A227-A3F2-4B36-8D65-E03192AA4C8C}"
EndProject
Global
	GlobalSection(SolutionConfigurationPlatforms) = preSolution
		Debug|Any CPU = Debug|Any CPU
		Release|Any CPU = Release|Any CPU
	EndGlobalSection
	GlobalSection(ProjectConfigurationPlatforms) = postSolution
		{BBA9A227-A3F2-4B36-8D65-E03192AA4C8C}.Debug|Any CPU.ActiveCfg = Debug|Any CPU
		{BBA9A227-A3F2-4B36-8D65-E03192AA4C8C}.Debug|Any CPU.Build.0 = Debug|Any CPU
		{BBA9A227-A3F2-4B36-8D65-E03192AA4C8C}.Release|Any CPU.ActiveCfg = Release|Any CPU
		{BBA9A227-A3F2-4B36-8D65-E03192AA4C8C}.Release|Any CPU.Build.0 = Release|Any CPU
	EndGlobalSection
	GlobalSection(SolutionProperties) = preSolution
		HideSolutionNode = FALSE
	EndGlobalSection
EndGlobal

By viewing downloads associated with this article you agree to the Terms of Service and the article's licence.

If a file you wish to view isn't highlighted, and is a text file (not binary), please let us know and we'll add colourisation support for it.

License

This article, along with any associated source code and files, is licensed under The MIT License


Written By
Web Developer
United States United States
This member has not yet provided a Biography. Assume it's interesting and varied, and probably something to do with programming.

Comments and Discussions