Question

Finding and repairing Kickbacks

  • 10 April 2019
  • 2 replies
  • 16 views
R
Badge

Does any know of a method of finding all 'kickbacks' within a polyline or polygon dataset, and then repairing/removing these?

A kickback is defined as:

  • The internal and external angles between two segments are less than the set parameter in degrees e.g. 45 degrees
  • The distance between the external spike and the external polygon boundary and the internal spike and the internal polygon boundary is less than the set parameter in metres e.g. 10m

FME has a transformer that deals with Spikes, but I cannot see an equivalent for kickbacks.

Thanks in advance

2 replies

ebygomm
Rank
Userlevel 1
Badge +21

Have you tried using the spike remover? It will eliminate kickbacks a lot of the time but whether the outcome is exactly as you would want is variable.

G
Badge +3

@robinb

 

I understand that a kickback is defined as a geometry where a part or parts doubles back on itself.

For linear objects that means you would have to chopp by 2 and then spatial relate to see if there are more than 1 related candidates.

Extracting and removing the vertices would clear it.

 

Polygons would have overlaps with itself.

If the kickback does not overlap, it would be considered a spike.

 

Do you have sample geometry?

 

Reply


Community Stats

28,743
Posts
109,586
Replies
36,584
Members
Terms & ConditionsCookie settings
A product of
Safe Software respectfully acknowledges that we live, learn and work on the traditional and unceded territories of the Kwantlen, Katzie, and Semiahmoo First Nations.