MINIMUM RECTANGULAR PARTITION PROBLEM FOR SIMPLE RECTILINEAR POLYGONS

Full metadata record

DC Field	Value	Language
dc.contributor.author	LIOU, WT	en_US
dc.contributor.author	TAN, JJM	en_US
dc.contributor.author	LEE, RCT	en_US
dc.date.accessioned	2014-12-08T15:05:32Z	-
dc.date.available	2014-12-08T15:05:32Z	-
dc.date.issued	1990-07-01	en_US
dc.identifier.issn	0278-0070	en_US
dc.identifier.uri	http://dx.doi.org/10.1109/43.55205	en_US
dc.identifier.uri	http://hdl.handle.net/11536/4064	-
dc.language.iso	en_US	en_US
dc.title	MINIMUM RECTANGULAR PARTITION PROBLEM FOR SIMPLE RECTILINEAR POLYGONS	en_US
dc.type	Article	en_US
dc.identifier.doi	10.1109/43.55205	en_US
dc.identifier.journal	IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS	en_US
dc.citation.volume	9	en_US
dc.citation.issue	7	en_US
dc.citation.spage	720	en_US
dc.citation.epage	733	en_US
dc.contributor.department	資訊工程學系	zh_TW
dc.contributor.department	Department of Computer Science	en_US
dc.identifier.wosnumber	WOS:A1990DL35300004	-
dc.citation.woscount	7	-
Appears in Collections:	Articles

Files in This Item:

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.