On The Construction Of Increasing-Chord Graphs On Convex Point Sets
2015 6TH INTERNATIONAL CONFERENCE ON INFORMATION, INTELLIGENCE, SYSTEMS AND APPLICATIONS (IISA)(2015)
摘要
A geometric path from s to t is increasing-chord if while traversing it from s to t the distance to the following (resp. from the preceding) points of the path decreases (resp. increases). A geometric graph is increasing-chord if each two distinct vertices are connected with an increasing-chord path.We show that given a convex point set P in the plane we can construct an increasing-chord graph consisting of P, at most one Steiner point and at most 4 vertical bar P vertical bar - 8 edges.
更多查看译文
关键词
Increasing-chord graph,Convex point set,Steiner point,Linear size
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络