For a list of all members of this type, see PolySimplification members.
| Name | Description | |
|---|---|---|
  | VertexReduction | 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. |