algorithm - Convex decomposition of a watershed -
watersheds , composed watersheds rather nasty polygonal regions, composed of rough boundary encapsulating blob-like domain (see example image below). however, several important operations related to, instance, conservative , consistent regridding of data, require these regions decomposed set of convex polygons. convex decompositions bayazit's algorithm (https://mpen.ca/406/bayazit) tend produce thin triangles poorly conditioned obtaining overlap regions , applying numerical quadrature. wondering if there algorithms available rapidly obtaining approximate convex decompositions of these kind of regions produce convex polygons of minimal quality? there no issue adding vertices within polygon, paving or analogous techniques may possible. further, suggestions libraries can handle problem?
a shapefile region representing watersheds along windward flank of mountain range.
Comments
Post a Comment