Visvalingam-Whyatt polyline simplification algorithm clarification
问题 I'm trying to implement a polyline simplification algorithm. The original article can be found here: http://archive.is/Tzq2. It seems straightforward in concept but I don't understand the sample algorithm (I think it's poorly worded) pseudocode supplied and was hoping someone could provide some insight. From the article, I gathered that the basic idea is to Calculate the effective area (formed by the triangle between three consecutive points on a line) for each point and delete those with 0