Class 3sum Hard Problems Computational by Ruci Ervin (2 results)
- Softcover
Seller: preigu, Osnabrück, Germanypreigu
Contact seller5-star sellerCondition: New
£ 38.21
£ 59.90 shippingShips from Germany to U.S.A.Quantity: 5 available
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: VDM Verlag Dr. Müller, Brivibas Gatve 197, 1039 RIGA, LETTLAND, customerservice[at]vdm-vsg[…dot]de | Anbieter: preigu.
- Softcover
- Print on Demand
Seller: AHA-BUCH GmbH, Einbeck, GermanyAHA-BUCH GmbH
Contact seller5-star sellerCondition: New
£ 43.19
£ 51.86 shippingShips from Germany to U.S.A.Quantity: 2 available
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-separat…orproblem.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.
