Computing the link center of a simple polygon
暂无分享,去创建一个
Micha Sharir | Subhash Suri | Godfried T. Toussaint | Jörg-Rüdiger Sack | Raimund Seidel | Chee-Keng Yap | Sue Whitesides | William J. Lenhart | Richard Pollack
[1] S. Suri. Minimum link paths in polygons and related problems , 1987 .
[2] Robert E. Tarjan,et al. Triangulating a Simple Polygon , 1978, Inf. Process. Lett..
[3] Micha Sharir,et al. Computing the geodesic center of a simple polygon , 1989, Discret. Comput. Geom..
[4] Godfried T. Toussaint,et al. An Optimal Algorithm for Determining the Visibility of a Polygon from an Edge , 1981, IEEE Transactions on Computers.
[5] Robert E. Tarjan,et al. An O(n log log n)-Time Algorithm for Triangulating a Simple Polygon , 1988, SIAM J. Comput..
[6] David Avis,et al. A Linear Algorithm for Computing the Visibility Polygon from a Point , 1981, J. Algorithms.
[7] Robert E. Tarjan,et al. A linear-time algorithm for triangulating simple polygons , 1986, STOC '86.
[8] Bernard Chazelle,et al. A theorem on polygon cutting with applications , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).
[9] E. Helly,et al. Über Systeme von abgeschlossenen Mengen mit gemeinschaftlichen Punkten , 1930 .
[10] Leonidas J. Guibas,et al. Visibility and intersectin problems in plane geometry , 1985, SCG '85.
[11] G. Toussaint,et al. Computing the Geodesic Center of a Simple Polygon , 1987 .
[12] M. Golumbic. Algorithmic graph theory and perfect graphs , 1980 .
[13] D. T. Lee,et al. Euclidean shortest paths in the presence of rectilinear barriers , 1984, Networks.