Skip to main content
Question

Finding and repairing Kickbacks


Forum|alt.badge.img+1

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

This post is closed to further activity.
It may be an old question, an answered question, an implemented idea, or a notification-only post.
Please check post dates before relying on any information in a question or answer.
For follow-up or related questions, please post a new question or idea.
If there is a genuine update to be made, please contact us and request that the post is reopened.

2 replies

ebygomm
Influencer
Forum|alt.badge.img+44
  • Influencer
  • April 10, 2019

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.


gio
Contributor
Forum|alt.badge.img+15
  • Contributor
  • April 10, 2019

@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?

 


Cookie policy

We use cookies to enhance and personalize your experience. If you accept you agree to our full cookie policy. Learn more about our cookies.

 
Cookie settings