Spec

Codefragmenten

curl "https://api.oanor.com/polygon-api/v1/meta" \
  -H "x-oanor-key: oanor_test_..."

await fetch("https://api.oanor.com/polygon-api/v1/meta", {
  headers: { "x-oanor-key": "oanor_test_..." }
});

$ch = curl_init("https://api.oanor.com/polygon-api/v1/meta");
curl_setopt($ch, CURLOPT_HTTPHEADER, ["x-oanor-key: oanor_test_..."]);
curl_setopt($ch, CURLOPT_RETURNTRANSFER, true);
$out = curl_exec($ch);

import requests
requests.get(
    "https://api.oanor.com/polygon-api/v1/meta",
    headers={"x-oanor-key": "oanor_test_..."}
)

Voorbeeldrespons

Een echte respons van dit endpoint, vastgelegd bij de laatste health check.

{
    "data": {
        "name": "Polygon Geometry API",
        "notes": "Planar cartesian coordinates. Shoelace area, ray-casting point-in-polygon, monotone-chain hull. Nothing is stored.",
        "version": "v1",
        "endpoints": [
            {
                "path": "/v1/area",
                "params": {
                    "polygon": "[[x,y],…] vertices"
                },
                "returns": "area, perimeter, centroid, orientation, convexity, bounding box"
            },
            {
                "path": "/v1/contains",
                "params": {
                    "point": "[x,y] (or x and y)",
                    "polygon": "[[x,y],…]"
                },
                "returns": "inside / outside / boundary"
            },
            {
                "path": "/v1/convex-hull",
                "params": {
                    "points": "[[x,y],…]"
                },
                "returns": "the convex hull and its area/perimeter"
            },
            {
                "path": "/v1/meta",
                "params": [],
                "returns": "this document"
            }
        ],
        "description": "Computational geometry for arbitrary polygons and point sets — on a plane, with no map or shape templates needed. The area endpoint takes a polygon as a list of [x,y] vertices and returns its area (by the shoelace formula), perimeter, centroid, winding orientation (clockwise or counter-clockwise), whether it is convex, and its bounding box. The contains endpoint tests whether a point is inside a polygon, outside it, or exactly on its boundary, using robust ray casting. The convex-hull endpoint computes the convex hull of a set of points (Andrew's monotone chain) and its area and perimeter. It works for any simple polygon, convex or concave. Everything is computed locally and deterministically, so it is instant and private. Ideal for graphics and games, GIS and mapping, CAD and collision detection, computational geometry, and data visualisation. Pure local computation — no key, no third-party service, instant. Live, nothing stored. 4 endpoints. This is planar polygon geometry; for the area of named shapes (circle, triangle, …) use a geometry API and for geographic GeoJSON area on the earth use a GeoJSON API."
    },
    "meta": {
        "timestamp": "2026-06-03T17:42:05.661Z",
        "request_id": "0e3728b3-3b9d-4ca7-8baf-383ce2ad3a1e"
    },
    "status": "ok",
    "message": "Meta",
    "success": true
}