On the time bound for convex decomposition of simple polygons
暂无分享,去创建一个
[1] David Avis,et al. A Linear Algorithm for Computing the Visibility Polygon from a Point , 1981, J. Algorithms.
[2] Leonidas J. Guibas,et al. Ray Shooting in Polygons Using Geodesic Triangulations , 1991, ICALP.
[3] B. Chazelle,et al. Optimal Convex Decompositions , 1985 .
[4] Leonidas J. Guibas,et al. Visibility and intersection problems in plane geometry , 1989, Discret. Comput. Geom..
[5] J. Mark Keil,et al. Decomposing a Polygon into Simpler Components , 1985, SIAM J. Comput..
[6] J. Sack,et al. Minimum Decompositions of Polygonal Objects , 1985 .
[7] Bernard Chazelle,et al. Decomposing a polygon into its convex parts , 1979, STOC.