I have two GPS coordinates (p, q)
that are endpoints of a segment. I have a third point c
which is the center of a circle with radius r
. My objective is to find the set of intersection points X
between these two geometries.
There can be at least 0 and at most 2 intersections. I didn't find any ellipse or circle like geometry in boost-geometry. Is there any intersection strategy that yields intersection point x
which is r
distance away from c
?
Boost Geometry doesn't have the concept of a circle.
The common way to approximate a circle is by generating a regular n-gon where n is high.
You could use a k-nearest search for the endpoints of the line segment instead: boost::geometry: nearest neighbors using a circle - this would answer a subset of the questions answerable with your question description.
The technical post webpages of this site follow the CC BY-SA 4.0 protocol. If you need to reprint, please indicate the site URL or the original address.Any question please contact:yoyou2525@163.com.