Weiler–Atherton clipping algorithm

From Wikipedia, the free encyclopedia
  (Redirected from Weiler–Atherton)
Jump to: navigation, search

The Weiler–Atherton is a polygon-clipping algorithm. It is used in the areas like computer graphics, games development and others where clipping of polygon 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. However, it can be used in 3D through visible surface determination and with improved efficiency through Z-ordering.[1]

Prelude[edit]

Subdivision with the Weiler-Atherton algorithm

Before applying to any 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, merging of polygons can be performed by a variant of the algorithm.

The Algorithm[edit]

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

  1. List the vertices of the clipping-region polygon A and those of the subject polygon B.
  2. Label the listed vertices of subject polygon B as either inside or outside of clipping region A.
  3. Find all the polygon intersections and insert them into both lists, linking the lists at the intersections.
  4. 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.
  5. Follow each intersection clockwise around the linked lists until the start position is found.

If there are no intersections then one of three conditions must be true:

  1. A is inside B – return A for clipping, B for merging.
  2. B is inside A – return B for clipping, A for merging.
  3. A and B do not overlap – return None for clipping or A & B for merging.

Conclusion[edit]

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.

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.

See also[edit]

References[edit]

  1. ^ 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