Generate the smallest possible, convex polygon which includes all points
Generate the smallest possible, convex polygon which includes all points
Add vertices along the line segments contained with a geometry
Add vertices along the line segments contained with a geometry
the upper bound on line segment lengths after densification
Simplify the given geometry
Simplify the given geometry
The tolerance, in distance, for ignoring small variations. More tolerance means a simpler polygon and more edges removed
Does not preserve topology: polygons may be split and holes may be created
The algorithms herein are all implemented in JTS, but the wrapper methods here make it straightforward to call them with geotrellis.vector classes.