The Graham scan triangulates simple polygons
暂无分享,去创建一个
[1] Robert E. Tarjan,et al. An O(n log log n)-Time Algorithm for Triangulating a Simple Polygon , 1988, SIAM J. Comput..
[2] Alain Fournier,et al. Triangulating Simple Polygons and Equivalent Problems , 1984, TOGS.
[3] Ronald L. Graham,et al. An Efficient Algorithm for Determining the Convex Hull of a Finite Planar Set , 1972, Inf. Process. Lett..
[4] A. Bykat,et al. Convex Hull of a Finite Set of Points in Two Dimensions , 1978, Inf. Process. Lett..
[5] Bernard Chazelle,et al. Triangulation and shape-complexity , 1984, TOGS.
[6] Kurt Mehlhorn,et al. Fast Triangulation of Simple Polygons , 1983, FCT.
[7] Godfried T. Toussaint,et al. An output-complexity-sensitive polygon triangulation algorithm , 1990 .
[8] Bernard Chazelle,et al. A theorem on polygon cutting with applications , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).
[9] David G. Kirkpatrick,et al. Polygon triangulation in O(n log log n) time with simple data-structures , 1990, SCG '90.
[10] Jack Sklansky,et al. Measuring Concavity on a Rectangular Mosaic , 1972, IEEE Transactions on Computers.
[11] Robert E. Tarjan,et al. Triangulating a Simple Polygon , 1978, Inf. Process. Lett..
[12] Gary H. Meisters,et al. POLYGONS HAVE EARS , 1975 .
[13] Godfried T. Toussaint,et al. An Optimal Algorithm for Determining the Visibility of a Polygon from an Edge , 1981, IEEE Transactions on Computers.