Computing simplified coverage polygons
A somewhat recurring problem I encounter in things I work on is the need to compute simplified geographic polygons, or more specifically, simplified hulls of geographic polygons. Here’s an overview on the currently used approach, maybe someone has pointers to better algorithms for this. Coverage polygons Geographic polygons are used in a few different places: The Transport API Repository and consumers of it like KPublicTransport use them for describing areas covered by a public transport rout