An efficient algorithm for decomposing a polygon into star-shaped polygons
暂无分享,去创建一个
[1] Steve Fisk,et al. A short proof of Chvátal's Watchman Theorem , 1978, J. Comb. Theory, Ser. B.
[2] Franco P. Preparata,et al. Location of a Point in a Planar Subdivision and Its Applications , 1977, SIAM J. Comput..
[3] Theodosios Pavlidis,et al. Decomposition of Polygons into Simpler Components: Feature Generation for Syntactic Pattern Recognition , 1975, IEEE Transactions on Computers.
[4] Kiyoshi Maruyama. Study of visual shape perception , 1972 .
[5] Theodosios Pavlidis,et al. Representation of figures by labeled graphs , 1972, Pattern Recognit..
[6] Theodosios Pavlidis,et al. A review of algorithms for shape analysis , 1978 .
[7] Bernard Chazelle,et al. Decomposing a polygon into its convex parts , 1979, STOC.
[8] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .
[9] V. Chvátal. A combinatorial theorem in plane geometry , 1975 .
[10] D. T. Lee,et al. Location of a point in a planar subdivision and its applications , 1976, STOC '76.
[11] Bruce J. Schachter,et al. Decomposition of Polygons into Convex Sets , 1978, IEEE Transactions on Computers.
[12] Godfried T. Toussaint,et al. PATTERN RECOGNITION AND GEOMETRICAL COMPLEXITY. , 1980 .
[13] Robert E. Tarjan,et al. Triangulating a Simple Polygon , 1978, Inf. Process. Lett..