I have a set of points (UK full postcode centroids). There is a hierarchical relationship in the postcodes to postcode sectors and postcode districts. The original sectors and districts are contiguous. I wish to derive approximate boundaries for the sectors and districts such that any part of country falls into exactly one sector and exactly one district, all resulting polygons should ideally be contiguous and (obviously?) all original points should be in the appropriate polygons. Is there some appropriate algorithm? Better yet, is there some appropriate implementation?
我想我必须解释得不好 因为我不认为这回答了我的问题。
让我们只谈一些部门,因为答案也适用于地区。
There are 1.8m coordinates. Consider each of these is tagged with a postcode such as "SG13 7AT" The postcode tag can itself reflects the postcode-sector-district structure - the sector in this case is "SG13 7" There is no other data than these points and their postcode tags.
我知道存在一个界定这一段的边界,然而,这一边界数据不能免费获得,每个后界码点已知位于其真正的区界内。
我希望重新建立部门边界的近似值,以使点位于新创建的多边形范围内,并使我创建的多边形毗连。 这些边界不会准确反映原始边界,但它们对我的目的来说足够好。
