Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Geodesy
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
== Geodetic problems {{anchor|Problems}} == {{further|Geodesics on an ellipsoid#Solution of the direct and inverse problems}} {{see also|Bearing (navigation)#Arcs}} {{unsourced section|date=February 2024}} In geometrical geodesy, there are two main problems: * '''First geodetic problem''' (also known as ''direct'' or ''forward geodetic problem''): given the coordinates of a point and the directional ([[azimuth]]) and [[distance]] to a second point, determine the coordinates of that second point. * '''Second geodetic problem''' (also known as ''inverse'' or ''reverse geodetic problem''): given the coordinates of two points, determine the azimuth and length of the (straight, curved, or [[geodesic]]) line connecting those points. The solutions to both problems in plane geometry reduce to simple [[trigonometry]] and are valid for small areas on Earth's surface; on a sphere, solutions become significantly more complex as, for example, in the inverse problem, the azimuths differ going between the two end points along the arc of the connecting [[great circle]]. The general solution is called the [[geodesic]] for the surface considered, and the [[differential equation]]s for the [[geodesic]] are solvable numerically. On the ellipsoid of revolution, geodesics are expressible in terms of elliptic integrals, which are usually evaluated in terms of a series expansion β see, for example, [[Vincenty's formulae]].
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)