Feature request #7304
Polygon partitioning by edge proximity
|Pull Request or Patch supplied:||No||Resolution:|
|Easy fix?:||No||Copied to github as #:||16304|
Can software (QGIS or some other) completely partition a polygon into disjoint subpolygons by edge proximity, so that each subpolygon consists of the part of the original polygon that is closest to a particular part of its edge?
See the attached sample file; a triangle with 1 green edge and 2 red edges. The green subpolygon consists of every point in the original triangle that is closer to the green edge than to any of the red edges. The red subpolygon consists of the rest (all the points that are closer to any of the red edges than to the green edge).
Of course I need an algorithm that can take complex large polygons (concave, with holes) and output the subpolygons.
#3 Updated by Giovanni Manghi almost 7 years ago
- Target version set to Future Release - Nice to have
- Subject changed from Polygon partitioning by edge proximity? to Polygon partitioning by edge proximity
Erik Sigra wrote:
It is a feature request
Then it would be better to rephrase the description and/or subject, it sounds more like a question on how to solve an issue, rather than a feature request. It seems to me also that this request is more adequate for a plugin rather than a core feature. Cheers!