Can polygons be self-intersecting?
A polygon can be self-intersecting, meaning edges cross other edges. (The points of intersection are not vertices.) Regular self-intersecting polygons are identified by a fraction n/m, where n is the number of edges (or vertices) and each vertex is connected to the mth vertex around the circle of vertices.
What is self intersect?
Self-intersecting polygons, crossed polygons, or self-crossing polygons are polygons some of whose edges cross each other. They contrast with simple polygons, whose edges never cross. Some types of self-intersecting polygons are: the crossed quadrilateral, with four edges.
How to repair a self intersecting polygon feature?
Repairs self-intersecting line or polygon features. The portion between the feature and the intersection points are either deleted or split into a new feature. This tool modifies the input data.
How are line segments used to determine polygons?
A polygon is usually made up of multiple line segments. A list showing which polygon is on the left and right of each segment is used to determine which polygon is which. Each segment has only one entry in this list. Suppose you have a line segment which goes from point A to point B.
What’s the difference between Split and delete self intersections?
The polyline or polygon feature class from which this tool will repair self-intersections. Indicates whether the tool will delete or split self-intersections. DELETE — Self-intersections will be deleted. This is the default. SPLIT — Self-intersections will be split at the intersection point and retained.
Is it OK to move a polygon with a point intersection?
If point intersections are not allowed, move one of them a small amount. In my experience, most such intersections some from a faulty polygon simplification, so it would be better to go back to the source if possible. Self-intersected polygon is invalid.