I have a single center point. Also, there is a number of additional points (in fact they are geographic coordinates, but it doesn't matter much in this case), for which I can calculate a direction. I need to find a smallest sector that will contain all of the points inside. Basically, it is this:
How do I approach the problem? Yeah, I know its basic math, but I'm stuck :(
Hint: Sector's area will be determined by two factors Angle of the sector and radius of the sector. Now from the points given how do you minimize both of them?