Gist 3900523
✓ Published0🌍 Public
RRCura
Last edited Oct 16, 2012
Created on Oct 16, 2012
This example demonstrates a geometric self-intersection detection routine for polyline coordinates. It iterates through each pair of non-adjacent line segments defined by the input x and y arrays, constructing segment geometries via `guilabs.createGeometry` and testing their intersection with the `Intersect` method. The visualization highlights the result of the intersection check, returning the final intersection geometry. The code is written in Python, relying on the `guilabs` library’s geometric primitives, and is intended to be run on coordinate sets containing at least three distinct points.
AI-generated description