Quadrant finder

It follows the standard mathematical convention — quadrant I is where both coordinates are positive, and the numbering proceeds counterclockwise. A zero coordinate is never forced into a quadrant: points lying on an axis are reported as axis points instead, which is the distinction most quick implementations get wrong. Both coordinates must be finite numbers; anything else returns a clear invalid-input error.

What the quadrant of a point means

The cartesian plane is split by the x-axis and the y-axis into four regions called quadrants. Quadrant I holds every point where x and y are both positive; moving counterclockwise, quadrant II has negative x and positive y, quadrant III has both coordinates negative, and quadrant IV has positive x and negative y. Knowing the quadrant of a point is more than a school exercise: it tells you the sign pattern of the coordinates without inspecting each value separately, which is exactly what trigonometry, physics simulations and game engines rely on when they interpret angles and vectors. A quadrant finder compresses that reasoning into one classification call. You send two numbers, and you receive either a quadrant number between one and four, or an explicit axis or origin location when a coordinate equals zero — because points on an axis belong to no quadrant at all, and conflating them with a quadrant is the classic off-by-one of coordinate geometry.

How the classification is decided

The rule is a strict sign test, applied in a fixed order so the result is always unambiguous. First the endpoint checks whether both coordinates are zero, in which case the point is the origin. Then it checks whether y is zero, which places the point on the x-axis, and whether x is zero, which places it on the y-axis. Only when both coordinates are non-zero does the sign of each one decide the quadrant: positive-positive is I, negative-positive is II, negative-negative is III, and positive-negative is IV. This ordering matters because a point like (0, 5) is on the y-axis, not in quadrant I or II, and (0, 0) is the origin rather than an arbitrary axis. Input validation is equally strict: each coordinate must be a finite number, so NaN, Infinity, missing fields and non-numeric values are rejected with an invalid-input error instead of producing a silently wrong classification.

Where it fits in real work

Educational tools use the endpoint to check student answers about the coordinate plane instantly and consistently. Game developers use quadrant logic to decide sprite orientation, minimap placement and collision regions, and this API lets server-side validation agree with the client. Data-visualization pipelines use it to bucket points into regions for coloring and annotation before rendering a scatter plot. Because the same deterministic code runs free in your browser on this page and on our edge for API calls, you can prototype a classification interactively and then automate it with confidence that the answers will match exactly. The call is stateless, stores nothing, and costs $0.002 per request when you call it through the API. For bulk work, send one request per point and aggregate the locations client-side; there is no batch variant, which keeps the contract — and its pricing — trivially predictable.