Buffer a point, line, or polygon
The area within a distance of a point, line, or polygon on the ellipsoid, or a polygon shrunk inward, with round, mitre, or bevel corners, measured back against the input.
The buffer covers 2.874127 km² in 1 part, every checked point within 0.124 m of the distance.
- Perimeter
- Parts
- Vertices
- Largest measured error
- Tolerance
Provenance
- Computed by
- geometry.buffer.geodesic 1.0.0, core 0.1.0
- Model
- On WGS 84: convex pieces (a rectangle per edge, a disk, wedge, or mitre per corner, a disk or square per line end) on an azimuthal equidistant plane at the input's center, unioned by keeping the edges no other piece covers; vertices on round and straight parts are then placed exactly at the distance from the nearest input point by the geodesic direct problem, and the distance is measured again at every vertex and edge midpoint (Karney 2013)
- Accuracy
- Round parts within 0.1% of the distance or 0.5 m, whichever is larger, as measured on every result; mitre and square corners sit at d / cos(θ/2) by construction. Input and buffer must fit within 1,000 km of their center
- Notes
- None
- Cites
- Karney, C. F. F., Journal of Geodesy, Algorithms for geodesics
Something look off?
How we got thisFormula, worked example, sources, and proof
Model: On WGS 84: convex pieces (a rectangle per edge, a disk, wedge, or mitre per corner, a disk or square per line end) on an azimuthal equidistant plane at the input's center, unioned by keeping the edges no other piece covers; vertices on round and straight parts are then placed exactly at the distance from the nearest input point by the geodesic direct problem, and the distance is measured again at every vertex and edge midpoint (Karney 2013)
Accuracy: Round parts within 0.1% of the distance or 0.5 m, whichever is larger, as measured on every result; mitre and square corners sit at d / cos(θ/2) by construction. Input and buffer must fit within 1,000 km of their center
When to use this: Use this to draw the zone within a distance of something on the ground: a geofence around a field, a setback from a property line, a corridor either side of a route, a noise or buffer zone around a runway, an exclusion radius around a point. A negative distance shrinks a polygon instead, which is how a setback inside a parcel is drawn. The corner style matters for a legal or regulatory setback — round follows the true distance, mitre carries the corner out to the intersection the way a surveyor draws it — and the result reports the area, the perimeter, and how far any measured point strayed from the distance asked for.
Limitations: The buffer and its input must fit within 1,000 km of their common center, because the construction runs on an azimuthal equidistant plane placed there and the plane stops being faithful beyond that; a larger shape is refused rather than quietly distorted. Round parts are drawn as a polygon, so the boundary is a chord inside the true curve between vertices — the vertices themselves sit on the distance, and the reported deviation is the worst sag in between, not an error in placing them. Mitre and square corners sit at the distance over the cosine of half the corner angle, which is farther out than the distance asked for; that is what a mitre is, and the mitre limit bevels a corner too sharp for it. A shrink can collapse a polygon to nothing or split it into pieces, which is reported rather than treated as failure. Shrinking a round buffer back by its own distance is one such collapse and is not a mistake: a round corner is drawn as a polygon inscribed in its arc, so it is short of the distance by the reported deviation, and eroding by more than that empties it. Use mitre corners if a buffer needs to be undone exactly. Areas and perimeters are on the ellipsoid, but the union is computed in the plane, so a self-touching or repeated input should be made valid first.
Worked example: A 500 m geofence around a field. Source: GeographicLib 2.7 GeodSolve, against 8,004 points sampled along the input rectangle: all 157 boundary vertices lie 500 m from it within 61 nanometres, and the worst chord midpoint sags 0.124103 m inside, which is the max_deviation of 0.1241033677 m the tool reports. It is golden test vector v025, and every build checks the tool still gives its answer within its tolerance.
You enter
- Distance
- 500 m
- Vertices
- 40, -105 40, -104.99 40.006, -104.99 40.006, -105
You get
- Area
- 2.874127 km²
- Perimeter
- 6.182 km
- Parts
- 1
- Vertices
- 157
- Largest measured error
- 0.124 m
- Tolerance
- 0.5 m
Review: Not yet independently reviewed by a GIS professional.
Last verified: 2026-09-18, when a maintainer last confirmed this tool's sources at the issuer. See the sources ledger.
Status: version 1.0.0, core 0.1.0. See this tool in the verification report.
Checked against: 30 golden test vectors (download the test vectors, each with its source and tolerance). See how results are checked and every source.
Sources
- Algorithms for geodesics, Karney, C. F. F., Journal of Geodesy, Vol. 87, No. 1. pp. 43-55 (direct and inverse problems; azimuthal equidistant projection, section 8).