For the problem of how to link a set of segments to a simple polygon with the shortest whole length,a sufficient condition that a given set of segments can be joined into a simple polygon is given. It is proved that the nearest point or second nearest point of the end point can be obtained in Delaunay triangulation for the end points of a set of segments S. Based on this result,the method of joining a segment into a polygon is given for getting the polygon with the shortest length. Then,a new algorithm for ...
| 
推荐 
点击下列相关研究机构和相关文献作者，可以直接查到这些机构和作者被《中国知识资源总库》收录的其它文献，使您全面了解该机构和该作者的研究动态和历史。
