On a Class of 3SUM-HARD problems in Computational Geometry

By Ervin Ruci

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... This description may be from another edition of this product.

• Format: Paperback
• Language: English
• ISBN: 3639158377
• ISBN13: 9783639158373
• Release Date: May 2009
• Publisher: VDM Verlag
• Length: 76 Pages
• Weight: 0.27 lbs.
• Dimensions: 0.2" x 6.0" x 9.0"