这次擂台赛题目为:判断平面上给定坐标的n个点能否构成一个凸多边形。 来稿提到了10多种方法,有些朋友提出的算法很有特点,构思也很巧妙,但作为解决问题方法优劣的判断与评奖只能是效率、编程实现的简洁与清晰。 这里给出并讨论一种简洁的判断算法。 首先不能不讨论该算法的数学依据,同时以下的讨论都假设n个点中任意两个点都不重复。 The Challenge Contest title is: to determine whether a given point on the plane n points can form a convex polygon. The manuscript mentions more than 10 methods. Some of the friends’ algorithms are very characteristic and their ideas are very clever. However, the judgments and awards as a solution to the problems and problems can only be efficiency and conciseness of programming. Here is a concise judgment algorithm given and discussed. First of all, can not but discuss the mathematical basis of the algorithm, while the following discussion assumes that no two points in n points are not repeated.