Minimum dissection of a rectilinear polygon with arbitrary holes into rectangles-Reference-Cited by-同舟云学术

Minimum dissection of a rectilinear polygon with arbitrary holes into rectangles

Published:1993-01 Issue:1 Volume:9 Page:57-79
ISSN:0179-5376
Container-title:Discrete & Computational Geometry
language:en
Short-container-title:Discrete Comput Geom

Author:

Soltan Valeriu,Gorpinevich Alexei

Publisher

Springer Science and Business Media LLC

Subject

Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Theoretical Computer Science

Link

http://link.springer.com/content/pdf/10.1007/BF02189307.pdf

Reference11 articles.

1. L. Ferrari, P. V. Sancar, and J. Sklansky, Minimal rectilinear partitions of digitized blocks,Comput. Vision Graphics Image Process. 28 (1984), 58–71.

2. A. N. Gorpinevich and V. Soltan, Simple algorithms of the partition of rectilinear regions into rectangles in VLSI engineering,Bull. Acad. Sci. Mold. SSR. Ser. Phis.—Tehn, and Math. Sci. No. 2 (1989), 19–25 (Russian).

3. H. Imai and T. Asano, Efficient algorithm for geometric graph search problems,SIAM J. Comput. 15 (1986), 478–494.

4. N. M. Kornienko, G. V. Matveev, N. N. Metelsky and R. I. Tyshkevich, On tiling of polygons,Izv. Akad. Nauk. BSSR. Ser. Phis.—Math. Sci. No. 2 (1978), 25–29 (Russian).

5. Lecture Notes on Computer Science;A. Lingas,1982

Cited by 27 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A hybrid heuristic for the rectilinear picture compression problem;4OR;2022-06-11

2. Diseño del encofrado para muros usando encofrados modulares;TecnoLógicas;2019-12-05

3. Approximation algorithms for decomposing octilinear polygons;Theoretical Computer Science;2019-08

4. Kronecker Modeling and Analysis of Multidimensional Markovian Systems;Springer Series in Operations Research and Financial Engineering;2018

5. Avoiding Unreachable States;Kronecker Modeling and Analysis of Multidimensional Markovian Systems;2018