Minimum Decompositions of Polygonal Objects

[1]  Bruce J. Schachter,et al.  Decomposition of Polygons into Convex Sets , 1978, IEEE Transactions on Computers.

[2]  Godfried T. Toussaint,et al.  PATTERN RECOGNITION AND GEOMETRICAL COMPLEXITY. , 1980 .

[3]  David Lichtenstein,et al.  Planar Formulae and Their Uses , 1982, SIAM J. Comput..

[4]  Godfried T. Toussaint,et al.  On a convex hull algorithm for polygons and its application to triangulation problems , 1982, Pattern Recognit..

[5]  Witold Lipski,et al.  Finding a manhattan path and related problems , 1983, Networks.

[6]  Hossam A. ElGindy,et al.  A new linear convex hull algorithm for simple polygons , 1984, IEEE Trans. Inf. Theory.

[7]  J. Mark Keil,et al.  Decomposing a Polygon into Simpler Components , 1985, SIAM J. Comput..

[8]  Godfried T. Toussaint,et al.  An Efficient Algorithm for Decomposing a Polygon into Star-Shaped Polygons , 1981 .

[9]  Andrzej Lingas,et al.  The Power of Non-Rectilinear Holes , 1982, ICALP.

[10]  Ronald L. Graham,et al.  An Efficient Algorithm for Determining the Convex Hull of a Finite Planar Set , 1972, Inf. Process. Lett..

[11]  B. G. Batchelor,et al.  Hierarchical Shape Description Based upon Convex Hulls of Concavities , 1980, Cybern. Syst..

[12]  Joseph O'Rourke,et al.  Some NP-hard polygon decomposition problems , 1983, IEEE Trans. Inf. Theory.

[13]  Davis Avis,et al.  On the complexity of finding the convex hull of a set of points , 1982, Discret. Appl. Math..

[14]  Theodosios Pavlidis,et al.  Analysis of set patterns , 1968, Pattern Recognit..

[15]  Bernard Chazelle,et al.  A theorem on polygon cutting with applications , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[16]  Godfried T. Toussaint.  A new linear algorithm for triangulating monotone polygons , 1984, Pattern Recognit. Lett..

[17]  David Avis,et al.  A Linear Algorithm for Finding the Convex Hull of a Simple Polygon , 1979, Inf. Process. Lett..

[18]  Theodosios Pavlidis,et al.  Decomposition of Polygons into Simpler Components: Feature Generation for Syntactic Pattern Recognition , 1975, IEEE Transactions on Computers.

[19]  F. Frances Yao,et al.  Finding the Convex Hull of a Simple Polygon , 1983, J. Algorithms.

[20]  Bernard Chazelle,et al.  Decomposing a polygon into its convex parts , 1979, STOC.

[21]  Narendra Ahuja,et al.  Interference Detection and Collision Avoidance Among Three Dimensional Objects , 1980, AAAI.

[22]  Robert E. Tarjan,et al.  Triangulating a Simple Polygon , 1978, Inf. Process. Lett..

[23]  Jack Sklansky,et al.  Minimal rectangular partitions of digitized blobs , 1984, Comput. Vis. Graph. Image Process..

[24]  J. Kahn,et al.  Traditional Galleries Require Fewer Watchmen , 1983 .

[25]  Takao Asano,et al.  Minimum partition of polygonal regions into trapezoids , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[26]  B. Chazelle.  Computational geometry and convexity , 1980 .

[27]  G. Klincsek.  Minimal Triangulations of Polygonal Domains , 1980 .