VertexReduction Method

Simple vertex reduction algorithm. Complexity: O(n) Summary: Include P0 in the result, and set R = P0. Iterate through subsequent points P1,P2,... until distance(PN, R) > tolerance. Include PN in the result, and set R = PN. Continue iterating in this fashion until there are no more points to consider for inclusion.

Syntax

C#

public static int VertexReduction( 
   Tuple<double[],double[]> points,
   double tolerance
)

Parameters

points

Input list of points

tolerance

The minimum distance allowed between adjacent points

Return Value

List of accepted points

Requirements

Target Platforms: Android 4.4+, iOS 8+

Development Environments: Visual Studio 2015+, Visual Studio for Mac Preview, Xamarin for Visual Studio 4.2+