Minimum partitioning simple rectilinear polygons in <i>O</i>(<i>n</i> log log <i>n</i>) - time

Abstract

Article Free AccessMinimum partitioning simple rectilinear polygons in O(n log log n) - time Authors: W. T. Liou Institute of Computer Science, National Tsing Hua University, Hsinchu, Taiwan, R.O.C. Institute of Computer Science, National Tsing Hua University, Hsinchu, Taiwan, R.O.C.View Profile , J. J. Tan Institute of Information Science, National Chiao Tung University, Hsinchu, Taiwan, R.O.C. Institute of Information Science, National Chiao Tung University, Hsinchu, Taiwan, R.O.C.View Profile , R. C. Lee National Tsing Hua University, Hsinchu, Taiwan, and the Academia Sinica, Taipei, Taiwan, R.O.C. National Tsing Hua University, Hsinchu, Taiwan, and the Academia Sinica, Taipei, Taiwan, R.O.C.View Profile Authors Info & Claims SCG '89: Proceedings of the fifth annual symposium on Computational geometryJune 1989 Pages 344–353https://doi.org/10.1145/73833.73871Published:05 June 1989Publication History 13citation1,034DownloadsMetricsTotal Citations13Total Downloads1,034Last 12 Months120Last 6 weeks20 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF