Area by coordinates calculator
The corners (0,0), (4,0), (4,3) and (0,3) enclose an area of 12, listed counterclockwise. Paste a lot’s corner coordinates in boundary order, closed or open, and get the area for paving, seeding or an exam check. Free in your browser.
- Free
- Runs in your browser
- No sign-up
- Your data stays on your device
Run — free
Runs in your browser. Free, unlimited — your data never leaves this page.
Surveyors, civil engineers, CAD operators, and students often need the area of a parcel or figure when the only data on hand is an ordered list of planar vertex coordinates. This area-by-coordinates calculator applies the classical shoelace (surveyor's) formula: half the absolute value of the cyclic sum of each x times the next y minus each next x times the current y. Paste three or more [x, y] points in boundary order, leave the first vertex unrepeated or repeated at the end if you prefer GIS-style rings, and receive the non-negative area, the signed area that reveals orientation, the vertex count after normalization, and the cleaned coordinate list. No network calls, no random sampling, and no model tokens—only deterministic arithmetic on the numbers you supply.
How the shoelace surveyor's formula computes polygon area
Label the ordered vertices of a simple closed polygon as (x0, y0) through (x_{n-1}, y_{n-1}) in either clockwise or counterclockwise order around the boundary. Dividing that sum by two yields a signed area: positive when the ring is listed counterclockwise in a right-handed Cartesian plane, negative when listed clockwise, and zero when the path collapses to a line or a single point after duplicates are removed.
The geometric area reported for design, homework, and inventory is always the absolute value of that signed quantity, so orientation does not change the magnitude you need for materials takeoff or exam answers. Classic classroom checks include the unit square with corners (0,0), (1,0), (1,1), (0,1) producing area one; the three-four-five right triangle with (0,0), (4,0), (0,3) producing area six; and a four-by-three axis-aligned rectangle producing area twelve.
Because every term is a product of two finite coordinates, the algorithm is O(n) in the number of vertices, uses only addition, subtraction, multiplication, and absolute value, and needs no trigonometric libraries or mesh triangulation for a simple ring. Self-intersecting bow-tie polygons still return a number, but that number is a signed algebraic area rather than a cleaned union of lobes—use a simple non-crossing boundary when you need physical land area.
Where area-from-coordinates tools earn their keep
Civil and construction workflows often receive lot corners as station-and-offset tables or DXF point lists long before a full CAD model exists; computing planar area from ordered coordinates lets estimators size paving, seeding, and roofing without waiting for a survey office deliverable. Analytic geometry courses and entrance exams repeatedly ask for the area of a polygon plotted on graph paper from labeled vertices; a deterministic shoelace oracle grades both magnitude and the understanding that order around the boundary matters for signed area even when only absolute area is scored.
If you later need spherical excess on the globe, Heron from three side lengths, or regular-polygon area from side length alone, treat those as separate search intents rather than overloading this coordinate-list landing. Keep requests under the vertex cap, document the precision you pin in tests, and you get reproducible surveyor's areas for classrooms, edge workers, and engineering notebooks without standing up a computational-geometry stack of your own.
What you can do with it
Parcel and paving takeoff
Turn ordered lot or pad corner coordinates into planar area for material estimates before a full CAD model is ready.
Homework and exam grading
Check polygon area from plotted vertices with a deterministic shoelace oracle that rejects under-sized rings.
GIS and game footprint tests
Pin area and orientation goldens for polygon rings shared by browser tools and automation scripts.
FAQ
How do I calculate polygon area from coordinates?
Send an ordered list of at least three [x, y] vertices in the coordinates field.
Do I need to repeat the first point at the end?
No. A trailing duplicate of the first vertex is optional and is dropped automatically before counting vertices.
What if I only send two points?
A polygon area needs at least three vertices after ring normalization; failed validation is not billed.
Does the order of the vertices matter?
Yes. List the corners in order around the boundary, clockwise or counterclockwise. The area is the same either way, while the signed area turns negative for a clockwise ring and tells you the orientation.
What happens with a polygon that crosses itself?
A bow-tie shape still returns a number, but it is a signed algebraic area, not the land area of its lobes. Use a simple boundary that does not cross itself when you need a physical area.
Related tools
For developers — API access
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.
API endpoint
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.
Call it from your stack
curl -X POST https://api.kit.forhosting.com/eng/area-coordinates \
-H "Authorization: Bearer $KIT_KEY" \
-H "Content-Type: application/json" \
-d '{"coordinates":[[0,0],[4,0],[4,3],[0,3]]}'const res = await fetch("https://api.kit.forhosting.com/eng/area-coordinates", {
method: "POST",
headers: {
"Authorization": `Bearer ${process.env.KIT_KEY}`,
"Content-Type": "application/json"
},
body: JSON.stringify({
"coordinates": [
[
0,
0
],
[
4,
0
],
[
4,
3
],
[
0,
3
]
]
})
});
const { task_id } = await res.json();import os, requests
res = requests.post(
"https://api.kit.forhosting.com/eng/area-coordinates",
headers={"Authorization": f"Bearer {os.environ['KIT_KEY']}"},
json={
"coordinates": [
[
0,
0
],
[
4,
0
],
[
4,
3
],
[
0,
3
]
]
},
)
task_id = res.json()["task_id"]<?php
$res = file_get_contents("https://api.kit.forhosting.com/eng/area-coordinates", false, stream_context_create([
"http" => [
"method" => "POST",
"header" => "Authorization: Bearer " . getenv("KIT_KEY") . "\r\nContent-Type: application/json",
"content" => '{"coordinates":[[0,0],[4,0],[4,3],[0,3]]}',
],
]));
$task = json_decode($res, true);body := bytes.NewBufferString(`{"coordinates":[[0,0],[4,0],[4,3],[0,3]]}`)
req, _ := http.NewRequest("POST", "https://api.kit.forhosting.com/eng/area-coordinates", body)
req.Header.Set("Authorization", "Bearer "+os.Getenv("KIT_KEY"))
req.Header.Set("Content-Type", "application/json")
res, _ := http.DefaultClient.Do(req)Example request
{
"coordinates": [
[
0,
0
],
[
4,
0
],
[
4,
3
],
[
0,
3
]
]
}Example response
{
"task_id": "tsk_a1b2c3d4e5f6a1b2c3d4e5f6",
"type": "eng.area_coordinates",
"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.
Pricing
Published price — no tokens, no invented credits. A failed task is never charged.
Errors
| HTTP | Code | Meaning |
|---|---|---|
401 | unauthorized | Missing or invalid API key. |
402 | insufficient_balance | Your balance doesn't cover the task price. |
404 | unknown_type | That task type doesn't exist. |
429 | rate_limited | Too many requests. Use the webhook instead of polling. |
Technical notes
The same pure module powers the free browser tool and the paid API path, so homework checks and production pipelines never disagree on a rectangle, triangle, or irregular lot. Degenerate rings with fewer than three vertices after closing-duplicate removal fail with invalid_input instead of inventing a zero-area success.
How the shoelace surveyor's formula computes polygon area
The shoelace identity, also called the surveyor's formula in civil engineering textbooks, states that twice the signed area equals the sum over i of x_i times y_{i+1} minus x_{i+1} times y_i, where the last edge wraps from the final vertex back to the first. Large coordinates can overflow IEEE-754 doubles; when the intermediate sum is non-finite the request fails with a clear message instead of serializing Infinity into JSON, keeping automated graders and edge workers honest about numerical range.
Input contract, ring normalization, and response fields
Each vertex may be a two-element array [x, y] or an object {x, y}; lon/lat-style keys lon and lat (or lng) are accepted when you are working in a local projected plane and reusing GIS object shapes. If the last point exactly equals the first, it is treated as a GIS closing duplicate and dropped before the count check, so both open rings and closed rings of four unique corners produce n equals four. Example: coordinates [[0,0],[4,0],[4,3],[0,3]] yields area twelve and counterclockwise orientation when the ring is listed in that order. POST a JSON body whose primary field is coordinates: an ordered array of at least three vertices. Aliases vertices, points, polygon, and coords map to the same list so form labels and SDK snippets stay readable. Optional precision (aliases decimals, dp) is an integer from zero to fifteen controlling decimal places on numeric fields; the default is ten for stable goldens across runtimes. Missing lists, non-arrays, non-finite coordinates, empty strings, and rings that collapse below three vertices after normalization raise invalid_input and are not billed. On success the body includes n (vertex count after normalization), area (non-negative), signed_area (orientation-aware), orientation as counterclockwise, clockwise, or degenerate, a formula string documenting the shoelace identity, and coordinates as the normalized {x, y} ring. Pair the free browser tool for quick sanity checks with the identical API contract when you batch hundreds of parcel outlines; both paths call the same pure solve function so floating results match byte-for-byte at a given precision. Successful API items cost the published base of $0.002; validation failures do not consume balance.
Technical questions
Does vertex order matter?
Yes for signed_area and orientation (counterclockwise vs clockwise), but the absolute area is the same magnitude either way for a simple ring.
What does the area-by-coordinates calculator cost?
The browser tool is free. API requests use prepaid KIT balance at $0.002 per successful call; invalid input is not billed.