Recover a shortened Plus Code from nearby coordinates

This tool restores the missing prefix by combining the short Open Location Code with a nearby reference latitude and longitude. It returns the recovered full code, its center coordinate, and the latitude and longitude boundaries of the encoded area. The calculation is deterministic, runs without a map lookup, and follows the cell-selection rules used by Open Location Code recovery.

Why a shortened Plus Code needs a reference point

A full Plus Code contains coarse location characters at the beginning and progressively finer characters toward the end. A shortened code deliberately removes some of that coarse prefix because people exchanging the code already know the city, neighborhood, or nearby landmark. For example, a local sign or message may show only a few characters before the plus sign. Those remaining characters describe repeating grid cells around the world, so the text alone is ambiguous. Recovery supplies the missing context as a reference latitude and longitude. The calculator first encodes that nearby coordinate at standard pair precision, takes exactly as many leading characters as the short code omitted, and joins that prefix to the supplied code. It then checks the center of the resulting cell against the reference point. This process does not search for an address, business, road, or administrative area. It restores the geographically nearest complete Open Location Code that is consistent with the shortened text and reference coordinates. A reference from the same locality is therefore the essential piece of information, not an optional accuracy hint.

How the nearest matching code is selected

Simply copying a prefix from the reference coordinate is usually enough, but locations close to a grid boundary need one more step. The provisional full code is decoded into a rectangular area with a center and north, south, east, and west limits. The calculator determines the resolution of the omitted prefix and compares the provisional center with the reference. If the center lies more than half of that resolution away, it shifts the candidate by one matching grid cell toward the reference, while respecting the latitude limits at the poles. Longitude is normalized across the antimeridian, so a nearby point on the other side of 180 degrees does not force a distant result. The final code is decoded again and returned with explicit bounds and center coordinates. This mirrors the intended nearest-area interpretation of a short Plus Code. It does not claim that the center is a building entrance or that every point in the returned cell has the same postal address. The bounds describe the encoded grid area, while the full code is the portable identifier you can store or pass to another Open Location Code implementation.

Choosing coordinates and interpreting the result

Use a coordinate that is genuinely near the place where the short code was created. A town center, a previously known waypoint, or the current GPS position can work when it is in the same local area. Greater shortening removes more of the geographic prefix and makes the acceptable reference area smaller in practical terms: an imprecise or distant reference can select a different repeating cell that still matches the remaining characters. After recovery, inspect both the full_code value and the returned center. The latitude_lo, latitude_hi, longitude_lo, and longitude_hi fields show the exact rectangle encoded by the result and are useful for map fitting or containment checks. Keep the original short code and reference coordinate in an audit record when reproducibility matters, because the full result is derived from both. Inputs are handled as decimal degrees, latitude must remain between the poles, and longitude must remain within the conventional signed range. The operation uses no network service, map database, current time, or random choice. The same valid input therefore produces the same recovered code and numeric area every time, whether called interactively or through an automated workflow at $0.002 per request.