On a Class of 3SUM-HARD problems in Computational Geometry: Cutting a polygon with a line - Softcover
Synopsis
Given 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.
"synopsis" may belong to another edition of this title.
About the Author
Born in Vlore, Albania where he lived until the age of 18, went abroad to study (Applied Math, Mount Allison University; Computational Geometry, Carleton University) and work (MTA, CIRA). Is now back in Vlore, teaching at the University of Vlora.
"About this title" may belong to another edition of this title.
Search results for On a Class of 3SUM-HARD problems in Computational Geometry:...
Seller Image
On a Class of 3SUM-HARD problems in ComputationalGeometry
Published by
VDM Verlag Dr. Müller, 2009
ISBN 10: 3639158377
ISBN 13: 9783639158373
New
Kartoniert / Broschiert
Seller: moluna, Greven, Germany
Seller rating 5 out of 5 stars
Kartoniert / Broschiert. Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Ruci ErvinBorn in Vlore, Albania where he lived until the age of 18, wentnabroad to study (Applied Math, Mount Allison UniversitynComputational Geometry, Carleton University) and work (MTA,nCIRA). Is now back in Vlore, teaching at t. Seller Inventory # 4962690
Buy New
£ 34.95
£ 42.36 shipping
Ships from Germany to U.S.A.
Ships from Germany to U.S.A.
Quantity: Over 20 available
Seller Image
On a Class of 3SUM-HARD problems in Computational Geometry : Cutting a polygon with a line
Print on DemandSeller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Given a simple polygon P and an integer K 1, wewant to compute the set ofstraight lines in the Cartesian plane that cut thispolygon into exactly K simplepolygons. We call this set of lines a K-separator andcall this problem the K-separatorproblem.We present an algorithm that finds the K-separatorsof 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 thepolygon, is there a line through this edge that cutsthe polygon in exactly K pieces , is3SUM-HARD. For the special case when K = 2, we showthat the decision problemcan be solved in O(n log(n)) time.Several other complexity results may be obtained. Wesuspect that the problemof finding the cell of maximum depth is also3SUM-hard, and as a corollary theproblem of identifying the line that cuts the polygonin the maximum possible numberof pieces is also 3SUM-hard. Seller Inventory # 9783639158373
Seller Image
On a Class of 3SUM-HARD problems in Computational Geometry | Cutting a polygon with a line
Seller: preigu, Osnabrück, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. On a Class of 3SUM-HARD problems in Computational Geometry | Cutting a polygon with a line | Ervin Ruci | Taschenbuch | Englisch | VDM Verlag Dr. Müller | EAN 9783639158373 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu. Seller Inventory # 101563316