Books about Polyhedral from Amazon.com

Discrete differential geometry is an active mathematical terrain where differential geometry and discrete geometry meet and interact It provides discrete equivalents of the geometric notions and methods of differential geometry, such as notions of curvature and integrability for polyhedral surfaces. Current progress in this field is to a large extent stimulated by its relevance for computer graphics and mathematical physics. This collection of essays, which documents the main lectures of the 2004 Oberwolfach Seminar on the topic, as well as a number of additional contributions by key participants, gives a lively, multi-facetted introduction to this emerging field.

.
Price: $31.45 [Notify me when price goes down.]

This book offers an in-depth overview of polyhedral methods and efficient algorithms in combinatorial optimization.These methods form a broad, coherent and powerful kernel in combinatorial optimization, with strong links to discrete mathematics, mathematical programming and computer science. In eight parts, various areas are treated, each starting with an elementary introduction to the area, with short, elegant proofs of the principal results, and each evolving to the more advanced methods and results, with full proofs of some of the deepest theorems in the area. Over 4000 references to further research are given, and historical surveys on the basic subjects are presented..
Price: $107.51 [Notify me when price goes down.]

MESH is a mathematical video on polyhedral meshes and their role in geometry, numerics and computer graphics. The film is completely computer-generated using the latest technology and spans the range from ancient Greek mathematics to the area of geometric modelling of today. MESH has already won several science awards worldwide. The authors are Konrad Polthier, a professor of mathematics, and Beau Janzen, a professional film director.

The film is an excellent teaching tool for courses on geometry, visualization, scientific computing and geometric modelling at universities and centres for computational science, and can be used in schools, too.

.
Price: $26.96 [Notify me when price goes down.]

For many years Stewart Coffin has been inventing and building solid geometrical puzzles. His craftsmanship and originality of design have won him a devoted following among puzzle enthusiasts and collectors the world over. In this unique book, Stewart provides an enjoyable and educational guide to the history, geometry, and practical construction of three-dimensional puzzles. The Puzzling World of Polyhedral Dissections includes full coverage of the many different types of interlocking assembly puzzles, from burrs, Tangrams, and polyominoes to those using such polyhedra as the rhombic dodecahedron and truncated octahedron. Coffin also describes numerous puzzles designed by himself and other inventors, many never before published. The volume is illustrated with over 200 line drawings and photographs to help enthusiasts build their own versions of these challenging and fascinating interlocking solids. Many unsolved problems are considered that will challenge mathematicians, computer buffs, and puzzle fanatics for years to come..
Price: $80.00 [Notify me when price goes down.]

Algebraic projective geometry, with its multilinear relations and its embedding into Grassmann-Cayley algebra, has become the basic representation of multiple view geometry, resulting in deep insights into the algebraic structure of geometric relations, as well as in efficient and versatile algorithms for computer vision and image analysis.

This book provides a coherent integration of algebraic projective geometry and spatial reasoning under uncertainty with applications in computer vision. Beyond systematically introducing the theoretical foundations from geometry and statistics and clear rules for performing geometric reasoning under uncertainty, the author provides a collection of detailed algorithms.

The book addresses researchers and advanced students interested in algebraic projective geometry for image analysis, in statistical representation of objects and transformations, or in generic tools for testing and estimating within the context of geometric multiple-view analysis.

.
Price: $55.50 [Notify me when price goes down.]

This book provides the first general account of the development of simplicial algorithms. These include the ubiquitous simplex method of linear programming widely used in industrial optimization and strategic decision making and methods important in data analysis, such as problems involving very large data sets. The theoretical development is based on a new way of representing the underlying geometry of polyhedra functions (functions whose graphs are made up of plane faces), and is capable of resolving problems that occur when combinatorially large numbers of faces intersect at each vertex..
Price: $74.01 [Notify me when price goes down.]

Presents algebraic and geometric algorithms to deal with a specific problem, which frequently occurs in model-based robotics systems and is of utmost importance in calibrating the complexity of robotics tasks in general. The algorithms are based on several ideas from areas such as elimination theory, optimization, polyhedral theory and Voronoi diagrams. The algorithms were also implemented in a Lisp in a workbench to allow experimentation with shortest path problems..
Price: $41.53 [Notify me when price goes down.]

Value-Range Analysis of C Programs describes a static analysis for detecting buffer overflows A buffer overflow in a C program occurs when input is read into a memory buffer whose length exceeds that of the buffer. Overflows usually lead to crashes and may even enable a malicious person to gain control over a computer system. They are recognised as one of the most widespread forms of computer vulnerability.

Based on the analysis of a standard mail-forwarding program, necessary refinements of the basic analysis are examined, thereby paving the way for an analysis that is precise enough to prove the absence of buffer overflows in legacy C code.

.
Price: $105.30 [Notify me when price goes down.]

This book presents an elementary introduction to the theory of oriented matroids The way oriented matroids are intro- duced emphasizes that they are the most general - and hence simplest - structures for which linear Programming Duality results can be stated and proved. The main theme of the book is duality. Using Farkas' Lemma as the basis the authors start withre- sults on polyhedra in Rn and show how to restate the essence of the proofs in terms of sign patterns of oriented ma- troids. Most of the standard material in Linear Programming is presented in the setting of real space as well as in the more abstract theory of oriented matroids. This approach clarifies the theory behind Linear Programming and proofs become simpler. The last part of the book deals with the facial structure of polytopes respectively their oriented matroid counterparts. It is an introduction to more advanced topics in oriented matroid theory. Each chapter contains suggestions for furt- herreading and the references provide an overview of the research in this field..
Price: $85.16 [Notify me when price goes down.]