Polygon Rectangle Clip

Description

Clip an ordered planar polygon against four rectangle half-planes, preserving algorithm order; floating boundary arithmetic, no polygon topology repair.

Planar geometry operates on two-coordinate Cartesian points and explicit shape boundaries. A closed rectangle includes its edges, while a segment parameter locates a point along a supporting line. Signed cross products, areas and axis gaps preserve orientation or direction information that a magnitude alone would lose.

Clip an ordered planar polygon against four rectangle half-planes, preserving algorithm order; floating boundary arithmetic, no polygon topology repair.

When to use this tool

Use this tool to clip an ordered planar polygon against four rectangle half-planes, preserving algorithm order; floating boundary arithmetic, no polygon topology repair.

How to use the tool and how it works

Enter points, rectangle using the input definitions below.
Run the operation. Resolve malformed-input errors before interpreting the result.
Read result.points. Interpret signs, units, ordering and null values using the rules below.

Clip the polygon successively to x≥minX, x≤maxX, y≥minY and y≤maxY. Preserve inside vertices and insert strict crossing intersections in each stage’s traversal order.^[1]

Input field	Meaning and units	Accepted input
points	Ordered planar [x,y] points. Polygon operations close the cycle implicitly; polyline operations use adjacent pairs only.	Dense list of at most 128 rows of at most 128 finite numbers; the operation’s shape constraints also apply.
rectangle	Closed rectangle [minX,minY,maxX,maxY]; equal bounds are allowed.	Dense list of at most 128 finite numbers, subject to the stated integer/shape rules.

Output field	Interpretation
result	Object containing the fields below.
result.points	Ordered resulting point coordinates under the stated clipping/intersection rule.

json

{
  "input": {
    "points": [
      [
        0,
        0
      ],
      [
        2,
        0
      ],
      [
        2,
        2
      ],
      [
        0,
        2
      ]
    ],
    "rectangle": [
      0,
      0,
      1,
      1
    ]
  },
  "output": {
    "result": {
      "points": [
        [
          0,
          0
        ],
        [
          1,
          0
        ],
        [
          1,
          1
        ],
        [
          0,
          1
        ]
      ]
    }
  }
}

Limitations and assumptions

This half-plane clipping does not repair invalid polygon topology, remove duplicate output vertices or represent holes/disconnected components as separate polygons.
Point components and rectangle bounds are finite within ±1,000,000,000. Rectangles use [minX,minY,maxX,maxY] with ordered inclusive bounds. Floating arithmetic is used without an implicit robustness tolerance.
Every declared top-level input is required and unknown fields are rejected. Ordinary strings are limited to 8,192 UTF-16 code units and lists to 128 entries, with tighter operation-specific bounds where stated. JSON text has bounded nesting and node counts.
Numeric outputs must be finite and within the absolute safe-integer magnitude; exact larger integers use decimal text. Source positions are zero-based UTF-16 offsets and span ends are exclusive unless a different convention is explicitly stated.

Alternative or Complementary methods

Choose the boundary and coordinate convention explicitly. Use robust geometric predicates or a topology-aware library when near-coincidence, holes, invalid polygons or geographic coordinates matter.

References

Tool behavior and example: Polygon Rectangle Clip — tool.io

Similar or alternative tools

Polygon Half Plane Clip
Clip an ordered polygon against the closed half-plane nx*x+ny*y<=maximum; no self-intersection validation or geographic geometry.
Polyline Rectangle Clip
Clip each polyline segment independently, retaining source-segment indexes and boundary point intersections instead of inventing path continuity.