|
|
|||
|
||||
OverviewGiven a simple polygon P and an integer K > 1, we want to compute the set of straight lines in the Cartesian plane that cut this polygon into exactly K simple polygons. We call this set of lines a K-separator and call this problem the K-separator problem. We present an algorithm that finds the K-separators of an n-vertex simple polygon, for all K > 0, in O(n2) total time. We prove that the decision problem given an integer K > 2 and an edge of the polygon, is there a line through this edge that cuts the polygon in exactly K pieces?, is 3SUM-HARD. For the special case when K = 2, we show that the decision problem can be solved in O(n log(n)) time. Several other complexity results may be obtained. We suspect that the problem of finding the cell of maximum depth is also 3SUM-hard, and as a corollary the problem of identifying the line that cuts the polygon in the maximum possible number of pieces is also 3SUM-hard. Full Product DetailsAuthor: Ervin RuciPublisher: VDM Verlag Dr. Muller Aktiengesellschaft & Co. KG Imprint: VDM Verlag Dr. Muller Aktiengesellschaft & Co. KG Dimensions: Width: 15.20cm , Height: 0.40cm , Length: 22.90cm Weight: 0.125kg ISBN: 9783639158373ISBN 10: 3639158377 Pages: 76 Publication Date: 20 May 2009 Audience: General/trade , General Format: Paperback Publisher's Status: Active Availability: In Print This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us. Table of ContentsReviewsAuthor InformationTab Content 6Author Website:Countries AvailableAll regions |