Geometric Approximation Algorithms (Mathematical Surveys and Monographs, 173, Band 173) - Hardcover

Inhaltsangabe

Har-Peled (U. of Illinois-Urbana-Champagne) primarily describes some key techniques in geometric approximation algorithms, but also more traditional computational geometry techniques such as sampling and linear programming as they are widely used in developing the algorithms. The material is expanded from a collection of class notes, until there is too much to cover it all in a single semester. He assumes students or readers to be familiar with some concepts in computational geometry such as arrangements, Delauney triangulations, Voroni diagrams, and point location. Annotation ©2011 Book News, Inc., Portland, OR (booknews.com)

Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.