Minimum Decompositions of Polygonal Objects

作者: J. Mark KEIL , Jorg-R. SACK

DOI: 10.1016/B978-0-444-87806-9.50012-8

关键词:

摘要: Publisher Summary This chapter discusses techniques for decompositions of objects into the minimum number some component type. In many applications, encountered are rectilinear polygons. image processing, boundaries often stored on a grid that usually implies digitized images Very large-scale integration (VLSI) designs also and typically contain The polygons when Steiner points allowed disallowed. It decomposition arbitrary simple result in this study concerns partitioning polygonal region trapezoids with two horizontal sides. Triangles side considered to be sides, one which is degenerate. problem closely related VLSI artwork data processing systems electron-beam lithography microfabrication. object contains holes.

参考文章(32)
H. ElGindy, D. Avis, G. Toussaint, Applications of a two-dimensional hidden-line algorithm to other geometric problems Computing. ,vol. 31, pp. 191- 202 ,(1983) , 10.1007/BF02263430
G.T. Klincsek, Minimal Triangulations of Polygonal Domains Combinatorics 79. ,vol. 9, pp. 121- 123 ,(1980) , 10.1016/S0167-5060(08)70044-X
Andrzej Lingas, The Power of Non-Rectilinear Holes international colloquium on automata, languages and programming. pp. 369- 383 ,(1982) , 10.1007/BFB0012784
Bernard Marie Chazelle, Computational geometry and convexity Yale University. ,(1980)
Andrzej Lingas, Heuristics for minimum edge length rectangular partitions of rectilinear figures Theoretical Computer Science. pp. 199- 210 ,(1983) , 10.1007/BFB0036481
Ronald L Graham, F Frances Yao, Finding the convex hull of a simple polygon Journal of Algorithms. ,vol. 4, pp. 324- 331 ,(1983) , 10.1016/0196-6774(83)90013-5
B. G. BATCHELOR, HIERARCHICAL SHAPE DESCRIPTION BASED UPON CONVEX HULLS OF CONCAVITIES Cybernetics and Systems. ,vol. 10, pp. 205- 210 ,(1980) , 10.1080/01969728008927632
J. O'Rourke, K. Supowit, Some NP-hard polygon decomposition problems IEEE Transactions on Information Theory. ,vol. 29, pp. 181- 190 ,(1983) , 10.1109/TIT.1983.1056648
Bernard Chazelle, David Dobkin, Decomposing a polygon into its convex parts symposium on the theory of computing. pp. 38- 48 ,(1979) , 10.1145/800135.804396
Michael R. Garey, David S. Johnson, Franco P. Preparata, Robert E. Tarjan, Triangulating a simple polygon Information Processing Letters. ,vol. 7, pp. 175- 179 ,(1978) , 10.1016/0020-0190(78)90062-5