Exact Convex Polygon Intersection

How to use Exact Convex Polygon Intersection

Normalize each strictly convex polygon to counterclockwise order, then successively clip the subject against each oriented clip edge. Exact half-plane and segment-line calculations retain boundary points rather than applying an arbitrary floating epsilon.

1. Enter model json (schema and units below).
2. Choose the stated convention and check the units and supported model.
3. Calculate, inspect the result, then copy or download it.

Good to know

• Plain decimal JSON numbers or strings, at most six fractional places, magnitude at most 1,000,000,000; raw numeric spellings and duplicate object members are checked. Exact rational arithmetic is capped at 8,192 bits. Text is at most 30,000 characters; a local JSON download preserves exact fractions or full stored approximate numbers. 3–30 distinct vertices per input in boundary order; strictly convex, simple, positive-area polygons only. Collinear input edge vertices are refused. Empty, point and segment intersections are valid zero-area outputs. No geographic coordinates, curved boundaries, concave clipping, holes or rendered file editing.
• Local calculation only; no input persistence or external lookup. Text/JSON is limited to 30000 characters and output to 1000000 characters. Numeric model inputs and precision/work limits are stated on this page. Approximate JSON numbers retain full stored values; exact arithmetic outputs retain decimal or fraction strings. Unsupported states fail explicitly.