You are here: Geometries > SherbendGeneralizer

SherbendGeneralizer

使用Sherbend算法通过基于线弯曲的分析来减少不必要的细节来简化线条。

Sherbend is a constraint-based algorithm that preserves the spatial relationship of the lines and points in the input data. The Sherbend algorithm iteratively generalizes the bends in a line by using the直径参数选择excentization弯曲。泛化过程可以消除,减少或组合弯曲,同时解决冲突。

The strategy for generalizing bends in a line is as follows:

  • Calculate the area of a reference circle whose diameter is specified by the直径parameter.
  • For each line, determine the locations of the bends.
  • 对于每个弯曲,计算其周边。接下来,构造圆周等于该周长的圆圈。最后,确定弯曲的调整区域,这是该圆面积的75%。
  • For each bend, generalize the bend if its area is below the area of the reference circle and spatial constraints are met.
  • Repeat the above steps until there are no more bends to generalize.

Input Ports

Output Ports

Parameters

Transformer

Parameters

Examples

在该示例中,弯曲减少(green= input,red= output):

In this example, a bend is eliminated:

In this example, three bends are combined into one:

The following diagram illustrates the generalization process on a single line in a real-world dataset:

This example illustrates the generalization process on a set of contours:

附加信息

The aim of line generalization is to reduce the details on a line for representation at a smaller scale. While the well-known Douglas-Peucker algorithm, is good at reducing the number of points in a line, it is not so good at removing unnecessary details in a line. TheGeneralizer.transformer contains a selection of algorithms under its parameters including the Douglas-Peucker algorithm.

In comparison, the Sherbend algorithm is well suited for the generalization of natural features (contours, lakes, rivers, wooded areas, etc.) because it preserves the general shape of the line. Moreoever, if spatial constraints are enabled, the spatial relationship between the input entities are preserved. The Douglas-Peucker algorithm with a small tolerance is often used before or after Sherbend to further reduce the number of points to further fulfill the goals of generalization.

Performance and Usage Notes

  • The Sherbend algorithm iteratively detects and generalizes bends, and then detects and resolves spatial conflicts. The generalized lines from one iteration are passed to the next iteration until the lines cannot be generalized further. Due to this iterative process, the algorithm is time-intensive, which is a tradeoff to improved accuracy and quality of generalization.
  • 约束检查是一种高度时间密集的操作。仅根据需要使用约束。
  • 要概括每个功能,请考虑使用Generalizer.transformer.

Editing Transformer Parameters

使用一组菜单选项,可以通过引用工作区中的其他元素来分配变压器参数。一些变压器也可提供更高级的功能,例如高级编辑器和算术编辑器。要访问这些选项的菜单,请单击除适用的参数旁边。有关更多信息,请参阅Transformer Parameter Menu Options.

Transformer Categories

Cartography and Reports

Geometries

Search FME Knowledge Center

Search for samples and information about this transformer on theFME Knowledge Center.