A geometric algorithmic technique that processes convex polygons by simulating a pair of antipodal calipers rotating around the polygon to locate extremal supporting directions, compute diameters, widths, minimum-area bounding rectangles and related extremal metrics in linear or near-linear time.

Principle

Maintain a constant set of antipodal contact points (caliper pairs) and advance them synchronously according to the polygonal edges' slopes so that every supporting direction is encountered once; extremal values occur at contact configurations encountered during the continuous rotation.

Demonstration

Given a convex polygon specified by its vertices in counterclockwise order, place four orthogonal calipers at antipodal supporting edges and rotate them by stepping to the next vertex when the supporting line changes slope; track the maximal distance between opposite calipers to compute the polygon diameter in O(n) time after convex-hull computation.

Misapplication

Applying the method directly to arbitrary non-convex polygons or point sets without first taking the convex hull; this can miss relevant local extrema or produce incorrect diameters because antipodal contact assumptions fail for concavities.

Consequence

When applied to convex polygons it yields optimal or near-optimal running times for many extremal geometric queries (diameter, width, minimum-area enclosing rectangle), translating global continuous optimization into a finite sequence of discrete updates.

Reversal

Holding calipers fixed at arbitrary directions and sampling discrete orientations instead of rotating continuously; this inversion can miss exact extremal configurations and produces only approximate or direction-dependent estimates rather than guaranteed extrema.

Boundary

Requires convexity (or prior reduction to the convex hull) and a polygonal representation with well-defined ordered vertices; it does not directly extend to higher-dimensional polytopes without significant modification and care about antipodality definitions.

Semantic Tension

Often compared with brute-force antipodal pair scanning or rotating-support-line arguments; tension arises with two-pointer or sweep-line methods — rotating calipers exploits geometry of convexity to achieve fewer updates than naive sweeping but is specialized compared to more general sweep techniques.

Synthesis

Rotating calipers converts continuous support-direction optimization on convex polygons into a synchronized discrete rotation of antipodal contact points; by exploiting convexity and edge-ordering it finds global extremal metrics efficiently while failing outside its convex scope.