ESSE 3600 Lecture Notes - Lecture 6: Vector Processor

• School: York University
• Department: Earth, Space Science and Engineering
• Course: ESSE 3600
• Professor: Sohn

Document Summary

Eats 3300 lecture 6 practise questions: line simplification creates a simplified line using a subset of the original vertices, while still retaining characteristics of the original line. The three types are local processing algorithms, pseudo-local processing algorithms, and global processing algorithms: three basic line simplification algorithms are perpendicular distance, angular algorithms, and lang algorithms. In a perpendicular distance algorithm, this is local processing, and the distance from p1 to p2 is greather than the threshold distance(see slide 8). In a perpendicular algorithm, also local, if the distance to p3 is less than the threshold distance, we can reject p3. In an angular algorithm, the angle is greater than the threshold angle, and the point is kept. If the angle is less than threshold angle, we reject p3. A lang algorithm is pseudo-local and the user must define two parameters, which is the number of points to look ahead, and a distance threshold parameter.