二次最小幂中心的几何刻画
A geometric characterisation of the quadratic min-power centre
摘要:
对于平面上给定的一组节点,最小功率中心是一个点,使得以该点为中心并跨越所有节点的星的成本最小化。星的成本被定义为它的节点的成本之和,其中节点的成本是其最长入射边的长度的增函数。最小功率中心问题提供了一个模型,用于最佳地定位一个簇头之间的一组无线电发射机,然而,该问题也可以制定一个双准则定位模型,涉及1-中心和广义的费马-韦伯点,使其适合于各种设施定位问题。我们使用最远点Voronoi图和Delaunay三角剖分提供了一个完整的几何描述的最小权力中心的一有限集的节点在欧几里德平面时,成本是一个二次函数。当已知节点的凸包时,给出了一种新的线性时间算法。我们还提供了一个上界的质心作为一个近似的二次最小功率中心的性能。最后,我们简要地描述了二次成本下的解和更一般的费用函数下的解之间的关系。
英文摘要:
For a given set of nodes in the plane the min-power centre is a point such that the cost of the star centred at this point and spanning all nodes is minimised. The cost of the star is defined as the sum of the costs of its nodes, where the cost of a node is an increasing function of the length of its longest incident edge. The min-power centre problem provides a model for optimally locating a cluster-head amongst a set of radio transmitters, however, the problem can also be formulated within a bicriteria location model involving the 1-centre and a generalized Fermat-Weber point, making it suitable for a variety of facility location problems. We use farthest point Voronoi diagrams and Delaunay triangulations to provide a complete geometric description of the min-power centre of a finite set of nodes in the Euclidean plane when cost is a quadratic function. This leads to a new linear-time algorithm for its construction when the convex hull of the nodes is given. We also provide an upper bound for the performance of the centroid as an approximation to the quadratic min-power centre. Finally, we briefly describe the relationship between solutions under quadratic cost and solutions under more general cost functions.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。