ForHosting KIT · Developer Utilities

Polygon convexity test

A polygon convexity test answers a fundamental computational-geometry question: given an ordered ring of Cartesian vertices, does every interior angle stay at most one hundred eighty degrees so the shape never dents inward?

● BetaFree · in your browser
Use it from WebAPIEmailTelegramApp soon

Surveyors validating cadastral parcels, game developers authoring collision hulls, GIS teams cleaning geofence polygons, CAD exporters enforcing convex constraints, and classroom tools grading simple-polygon exercises all need a deterministic yes-or-no answer without standing up a full geometry library. This capability accepts an ordered list of vertices, walks the closed ring once, and compares the two-dimensional cross product of each pair of consecutive edges. When every non-zero cross product shares the same sign, every turn goes the same way and the polygon is convex; mixed signs mean at least one reflex angle and the polygon is concave. Zero cross products mark collinear vertices and are allowed without breaking convexity. The same pure analytic module powers the free browser widget and the prepaid API path, so homework oracles and production pipelines never disagree on a square versus a dart-shaped pentagon.

How to use it

Enter your values in the form above. The tool checks them before calculating and shows the result on the same page.

Check your inputs

Use the labels and units shown next to each field. If something is missing or outside the allowed range, the page points to the field to fix.

Use it again or automate it

Use the browser tool for individual checks and the API when you need the same capability in an automated workflow.

Get an answer now

Enter one set of values and see the result without building a spreadsheet or script.

Compare scenarios

Change one value at a time and rerun the calculation to understand what affects the result.

Automate repeated work

Use the API when the same calculation needs to run inside your product or workflow.

How do I use this capability?

Complete the fields above and run it on this page. The form highlights anything that needs attention.

Everything on this page is available programmatically. This section is for teams who want to wire it into their own systems; everyone else can just use the tool above.

POSThttps://api.kit.forhosting.com/geo/polygon-is-convex

Prefer to automate it? One authenticated POST creates the task; the result comes back by webhook or a signed link. The same capability also runs here on the web, by email and from Telegram — and soon from our app too.

curl -X POST https://api.kit.forhosting.com/geo/polygon-is-convex \
  -H "Authorization: Bearer $KIT_KEY" \
  -H "Content-Type: application/json" \
  -d '{"vertices":[{"x":0,"y":0},{"x":4,"y":0},{"x":4,"y":3},{"x":0,"y":3}]}'
{
  "vertices": [
    {
      "x": 0,
      "y": 0
    },
    {
      "x": 4,
      "y": 0
    },
    {
      "x": 4,
      "y": 3
    },
    {
      "x": 0,
      "y": 3
    }
  ]
}
{
  "task_id": "tsk_a1b2c3d4e5f6a1b2c3d4e5f6",
  "type": "geo.polygon_is_convex",
  "status": "queued",
  "_links": {
    "result": "/tasks/tsk_…/result"
  }
}

The API is asynchronous: the call returns a task_id immediately and the result arrives by webhook. Polling is capped at 1 req/s per task.

Per request$0.002

Published price — no tokens, no invented credits. A failed task is never charged.

HTTPCodeMeaning
401unauthorizedMissing or invalid API key.
402insufficient_balanceYour balance doesn't cover the task price.
404unknown_typeThat task type doesn't exist.
429rate_limitedToo many requests. Use the webhook instead of polling.

Read the full KIT documentation →