Through the algorithm can be obtained a set of points covered by two equal radii and the smallest circle.
该算法可以求得两个半径相等而且最小的圆覆盖点集。
In the case of a TLU with an arbitrary number of inputs, n, the set of possible inputs corresponds to a set of points in N-dimensional space.
在TLU有任意数目的N个输入的情况下,一组可能的输入对应于n维空间中的一个点集。
A diagram that exhibits a relationship, often functional, between two sets of Numbers as a set of points having coordinates determined by the relationship.
图表示两组数的关系,通常为函数关系的图,如由这种关系确定一系列有坐标的点。
You are to write a program to find a circle which covers a set of points and has the minimal area. There will be no more than 100 points in one problem.
但是提供了一个思路,枚举的时候如果点非常多,是否可以从直径开始找最小覆盖圆,效率是否会更优?
Specifically, given a set of points in the plane, please construct the convex hull and output an encoded description of all the extreme points.
具体地,对于平面上的任意一组点,请构造出对应的凸包,并在经过编码转换之后输出所有极点的信息。
In this paper, a new method for determining the optimum uniformly approximating line of a set of points is presented.
本文提出一个求点集的最佳一致逼近直线的新方法。
It identifies a set of points in the execution of a program where an aspect should apply.
它在程序执行中确定应该应用某个切面的点的集合。