Weiler–Atherton clipping algorithm: Difference between revisions

Revision as of 19:23, 23 July 2015

Latest revision as of 05:51, 4 July 2023

(17 intermediate revisions by 10 users not shown)

Line 1:

{{Short description|Polygon clipping algorithm}}

The '''Weiler–Atherton''' is a polygon -[[Clipping (computer graphics)|clipping]] [[algorithm]]. It is used in the areas like [[computer graphics]], and games development and others where clipping of polygonpolygons is needed. It allows clipping of a ''subject or candidate polygon'' by an arbitrarily shaped ''clipping polygon/area/region''.

It is generally applicable only in [[2D computer graphics|2D]]. However, it can be used in [[3D computer graphics|3D]] through visible surface determination and with improved efficiency through [[Z-order]]ing.<ref>Foley, James, Andries van Dam, Steven Feiner, and John Hughes. "Computer Graphics: Principle and Practice". Addison-Wesley Publishing Company. Reading, Massachusetts: 1987. pages 689-693</ref>

== PreludePreconditions ==

[[image:Weiler-Atherton subdivision.svg|thumb|upright=1.2|Subdivision with the Weiler-Atherton algorithm]]

Before applyingbeing applied to anya polygon, the algorithm requires several preconditions to be fulfilled. :

-* Candidate polygons need to be oriented clockwise.

-* Candidate polygons should not be self -intersecting (i.e., re-entrant).

-* The algorithm can support holes (as counter-clockwise polygons wholly inside their parent polygon), but requires additional algorithms to decide which polygons are holes. Then, after which merging of the polygons can be performed byusing a variant of the algorithm.

== The Algorithm ==

- Candidate polygons should not be self intersecting (i.e. re-entrant).

Given polygon A as the clipping region and polygon B as the subject polygon to be clipped, the algorithm consists of the following steps:

First,# two lists are created where one list containsList the vertices of the clipping-region polygon A and the another list contains the verticesthose of the subject polygon B.

# Label the listed vertices of subject polygon B as either inside or outside of clipping region A.

All# Find all the polygon intersections are then found and areinsert insertedthem into both lists, linking the lists at the intersections. Care will be needed where the polygandidate ons share an edge.

# Generate a list of "inbound" intersections – the intersections where the vector from the intersection to the subsequent vertex of subject polygon B begins inside the clipping region.

# Follow each intersection clockwise around the linked lists until the start position is found.

If there are no intersections then one of three situationsconditions existmust be true:

- The algorithm can support holes (as counter-clockwise polygons wholly inside their parent polygon), but requires additional algorithms to decide which polygons are holes. Then, merging of polygons can be performed by a variant of the algorithm.

== The Algorithm ==

Suppose, A is the clipping polygon/region/area, and, B is the candidate polygon/subject polygon/polygon to be clipped.

First, two lists are created where one list contains the vertices of the clipping polygon A and the another list contains the vertices of the subject polygon B.

The list entries are labelled as either inside or outside the other polygon.

All the polygon intersections are then found and are inserted into both lists, linking the lists at the intersections. Care will be needed where the polygandidate ons share an edge.

If there are no intersections then one of three situations exist:

# A is inside B – return A for clipping, B for merging.

# B is inside A – return B for clipping, A for merging.

# A and B do not overlap – return None for clipping or A & B for merging.

== Conclusion ==

A list of inbound intersections is then generated. Each intersection in the list is then followed clockwise around the linked lists until the start position is found. One or more concave polygons may produce more than one intersecting polygon. Convex polygons will only have one intersecting polygon.

The same algorithm can be used for merging two polygons by starting at the outbound intersections rather than the inbound ones. However this can produce counter-clockwise holes.

Line 32:

Some polygon combinations may be difficult to resolve, especially when holes are allowed.

Points very close to the edge of the other polygon may be considered as both in and out until their status can be confirmed after all the intersections have been found and verified,; however, this increases the complexity.

Various strategies can be used to improve the speed of this labeling, and to avoid needing to proceed further. Care will be needed where the polygons share an edge.

== Conclusion ==

Various strategies can be used to improve the speed of this labeling, and to avoid needing to proceed further.

==See also==

Line 47 ⟶ 46:

{{DEFAULTSORT:Weiler-Atherton clipping algorithm}}

[[Category:ClippingPolygon (computerclipping graphics)algorithms]]