Minimum dissection of rectilinear polygon with arbitrary holes into rectangles

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Minimum dissection of rectilinear polygon with arbitrary holes into rectangles

Full text

Pdf (446 KB)

Source

Annual Symposium on Computational Geometry archive
Proceedings of the eighth annual symposium on Computational geometry table of contents

Berlin, Germany

Pages: 296 - 302

Year of Publication: 1992

ISBN:0-89791-517-8

Authors

Valeriu Soltan
Alexei Gorpinevich

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGGRAPH: ACM Special Interest Group on Computer Graphics and Interactive Techniques

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 3, Downloads (12 Months): 23, Citation Count: 2

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/142675.142735 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	W.Lipski, Finding a Nanhattan path and related problems, Networks 13 (1983), 399-409.
	2	Witold Lipski, Jr., An O(n log n) Manhattan path algorithm, Information Processing Letters, v.19 n.2, p.99-102, August 1984 [doi>10.1016/0020-0190(84)90105-4]
	3	Hiroshi Imai , Takao Asano, Efficient algorithms for geometric graph search problems, SIAM Journal on Computing, v.15 n.2, p.478-494, May 1986 [doi>10.1137/0215033]
	4	A.Lingas, The power of nonrectilinear holes, Lect. Notes Comput. Sci. 140 (1982), 369-383

CITED BY 2

	Danny Z. Chen , Xiaobo S. Hu , Shuang Luan , Chao Wang, Geometric algorithms for static leaf sequencing problems in radiation therapy, Proceedings of the nineteenth annual symposium on Computational geometry, June 08-10, 2003, San Diego, California, USA
	Rakesh Agrawal , Johannes Gehrke , Dimitrios Gunopulos , Prabhakar Raghavan, Automatic Subspace Clustering of High Dimensional Data, Data Mining and Knowledge Discovery, v.11 n.1, p.5-33, July 2005