We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
A second usefull piece of code would be a triangulation example.
Two points on a sphere, plus two bearings/headings.
The intersection of these imaginary lines/arcs would indicate where the "perceived" object would be. a third point... / intersection point.
The text was updated successfully, but these errors were encountered:
This is what I call the intersection problem. It is addressed in
Karney, Algorithms for geodesics, Section 8 https://doi.org/10.1007/s00190-012-0578-z
Baselga & Martinez-Llario, Intersection and point-to-line ..., Section 2 https://doi.org/10.1007/s11200-017-1020-z
I plan to address this problem in more detail in a future publication. ETA = 12 months.
Sorry, something went wrong.
This problem is addressed in my recent paper Geodesic intersections. GeographicLib version 2.3 implements these methods (in C++).
No branches or pull requests
A second usefull piece of code would be a triangulation example.
Two points on a sphere, plus two bearings/headings.
The intersection of these imaginary lines/arcs would indicate where the "perceived" object would be. a third point... / intersection point.
The text was updated successfully, but these errors were encountered: