求二次不等式组的解
我有一个不等式系统,表示同心椭圆对之间的面积,如下图所示: 链接到desmos 上的图表 我想计算近似未阴影区域的多边形顶点的坐标。最终目标是计算该多边形的最小外接圆: 我研究了处理线性表达式的类似问题 它使用 scipy.optimize.linprog ,但是我不认为这在这种情况下可用,我正在处理二次方程并且不试图找到最大值或最小值为一个表达式。
I have a system of inequalities representing the area between pairs of concentric ellipses, as seen in the following diagram: Link to the graph on desmos
I want to calcualte the coordinates of the vertices of the polygon approximating the unshaded area. The ultimate goal is to calculate the minimum bounding circle of this polygon:
I've researched a similar question dealing with linear expressions which uses scipy.optimize.linprog
, however I do not believe that this would be usable in this case I am dealing with quadratic equations and am not trying to find maximum or minimum values for an expression.
如果你对这篇内容有疑问,欢迎到本站社区发帖提问 参与讨论,获取更多帮助,或者扫码二维码加入 Web 技术交流群。
绑定邮箱获取回复消息
由于您还没有绑定你的真实邮箱,如果其他用户或者作者回复了您的评论,将不能在第一时间通知您!
发布评论