Simplify
Reduces vertex count while approximating the shape to improve performance and reduce file size.
Category: Operations
Definition (expanded)
Simplification uses algorithms like Douglas–Peucker. It is a tradeoff between fewer vertices and accuracy. Over-simplification can create self-intersections or remove small features. Always sanity-check results on a map.
Related terms
VertexA single coordinate point in a ring or line; polygons are made of many vertices.Valid geometryA geometry that follows topological rules (closed rings, no self-intersections, properly nested holes, etc.).ToleranceA threshold distance used by simplify, snapping, and some repair operations.Coordinate precisionHow many decimal places you keep in coordinates, which affects file size and geometric stability.Douglas–Peucker algorithmA common simplification algorithm that removes vertices while keeping the shape within a tolerance.