发现包括其他各界最小的圈？ [英] Finding the smallest circle that encompasses other circles?

问题描述

如果一个圆是由X定义的，它ÿ中心和半径，那我怎么才能发现，包括圈给定数量的圆？单圈就是尽可能小的圈子完全包含2或多个圈子的大小和位置。

If a circle is defined by the X, Y of it's center and a Radius, then how can I find a Circle that encompasses a given number of circles? A single circle that is the smallest possible circle to completely contain 2 or more circles of any size and location.

起初我尝试了通过查找中点包含2个圈该中心并作为新圆的中点，而半径等于2初始圆半径的一半和它们的中心之间距离的一半，但不知何故，它总是被证明是有点过。这个问题似乎总是与寻找半径的问题，但我有这样一个头疼这个我不能使它工作。

At first I tried just encompassing 2 circles by finding the midpoint of the centers and that being the midpoint of the new circle while the radius was equal to the half of the radius of the 2 initial circles and half the distance between their centers, but somehow it always turned out to be a little off. The problem always seemed to be a problem with finding the radius, but I have such a headache about this I can't make it work.

我不一定需要对发现​​包含3个或更多圈一个圈的方法。我能找到，它包括2圈，走了一圈，并包括与另一个，另一个，最后圈应包括整个步骤，给社会各界。

I don't necessarily need a method for finding a circle that encompasses 3 or more circles. I can find a circle that encompasses 2, take that circle and encompass it with another, and another, and the final circle should encompass all circles given throughout the steps.

推荐答案

其称为最小包围圆（MEC），或有时最小包围圆

Its termed Minimum Enclosing Circle ("MEC"), or sometimes "smallest enclosing circle".

一个不错的网站： http://www.personal.kent.edu/~rmuhamma/Compgeometry/MyCG /CG-Applets/Center/centercli.htm

这篇关于发现包括其他各界最小的圈？的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！