I am working with a sensor that outputs data in forms of radial beams. In order for it to be useful for my application I have to compute a value of one side of the acute triangles that can be seen in the radial beams. Inside these triangles I can then check whether or not an obstacle is seen. Here's the diagram (sorry about the quality, I tried my best):
- Assume α = β.
- Assume the segments and their angles aren't up to scale.
- Assume there are 16 radial segments (or arcs), first one perpendicular to the Y-axis, the last one is parallel with the X-axis, and that the angles subtended by the arcs are all equal.
- Assume the radii and the angles of the arcs are known.
- Assume TU is known.
How would one calculate triangles' side created within the segments? For example, let's take triangles CAR and RAP (the names are accidental!), is it possible to calculate their sides, especially the opposites of the angles α and β, CR and RP?
My current idea is to use TU, form right angle triangles such as APJ (imagine if T was overlaying P) and use the angles known to calculate the remaining sides. The problem with that is it becomes increasingly complex for increasing number of segments.
Is there a better way of doing it, keeping in mind that it's a part of a obstacle detection algorithm?
EDIT 1: got rid of a redundant line, updated the diagram.
EDIT 2: extra question: imagine arc c being absent and the first arc is actually arc d (so no parallel segment with the Y-axis to begin with). How would you approach this problem in that case?