Описание: Along with an introduction to geometric algebra, and the necessary math concepts, the book examines various applications in the field of cognitive systems using geometric algebra as the mathematical system. Aimed at computer scientists and engineers, it includes programs to clarify and demonstrate the importance of geometric in cognitive systems.
Автор: Demaine, Erik D. O`rourke, Joseph Название: Geometric folding algorithms ISBN: 0521715229 ISBN-13(EAN): 9780521715225 Издательство: Cambridge Academ Рейтинг: Цена: 5866 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Lavishly illustrated and entertaining account of the surprising and useful results of the maths of folding and unfolding.
Описание: The art of origami, or paper folding, is carried out using a square piece of paper to obtain attractive figures of animals, flowers or other familiar figures. This book considers origami an object of mathematical exploration. It provides a useful, alternative approach for reinforcing and applying the theorems of high school mathematics.
Описание: Possibly the most comprehensive overview of computer graphics as seen in the context of geometric modelling, this two volume work covers implementation and theory in a thorough and systematic fashion. Computer Graphics and Geometric Modelling: Implementation and Algorithms, covers the computer graphics part of the field of geometric modelling and includes all the standard computer graphics topics. The first part deals with basic concepts and algorithms and the main steps involved in displaying photorealistic images on a computer. The second part covers curves and surfaces and a number of more advanced geometric modelling topics including intersection algorithms, distance algorithms, polygonizing curves and surfaces, trimmed surfaces, implicit curves and surfaces, offset curves and surfaces, curvature, geodesics, blending etc. The third part touches on some aspects of computational geometry and a few special topics such as interval analysis and finite element methods. The volume includes two companion programs.
Описание: Generalizes and develops the generating function and Hamilton-Jacobi equation theory from the perspective of the symplectic geometry and symplectic algebra. This title is suitable for engineers and scientists in the fields of quantum theory, astrophysics, atomic and molecular dynamics, climate prediction, and oil exploration.
Автор: Basu Название: Algorithms in Real Algebraic Geometry ISBN: 3540330984 ISBN-13(EAN): 9783540330981 Издательство: Springer Рейтинг: Цена: 10449 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: A graduate textbook on the algorithmic aspects of real algebraic geometry. It contains several results, on discriminants of symmetric matrices, real root isolation, global optimization, quantitative results on semi-algebraic sets and the first single exponential algorithm computing the first Betti number.
Автор: Ron Goldman Название: Pyramid Algorithms, ISBN: 1558603549 ISBN-13(EAN): 9781558603547 Издательство: Elsevier Science Рейтинг: Цена: 11182 р. Наличие на складе: Поставка под заказ.
Описание: "Pyramid Algorithms" presents a unique approach to understanding, analyzing, and computing the most common polynomial and spline curve and surface
schemes used in computer-aided geometric design, employing a dynamic programming method based on recursive pyramids. The recursive pyramid approach offers the distinct
advantage of revealing the entire structure of algorithms, as well as relationships between them, at a glance. This book is the only one built around this approach - it is certain to change
the way you think about CAGD and the way you perform it, and all it requires is a basic background in calculus and linear algebra, and simple programming skills.
one of the world
s most eminent CAGD researchers, it is designed for use as both a professional reference and a textbook, and addressed to computer scientists, engineers, mathematicians,
theoreticians, and students alike. It includes chapters on Bezier curves and surfaces, B-splines, blossoming, and multi-sided Bezier patches. It relies on an easily understood notation,
and concludes each section with both practical and theoretical exercises that enhance and elaborate upon the discussion in the text.
Foreword is by Professor Helmut
Pottmann, Vienna University of Technology.
Описание: Integral Closure gives an account of theoretical and algorithmic developments on the integral closure of algebraic structures. These are shared concerns in commutative algebra, algebraic geometry, number theory and the computational aspects of these fields. The overall goal is to determine and analyze the equations of the assemblages of the set of solutions that arise under various processes and algorithms. It gives a comprehensive treatment of Rees algebras and multiplicity theory - while pointing to applications in many other problem areas. Its main goal is to provide complexity estimates by tracking numerically invariants of the structures that may occur.This book gives an account of theoretical and algorithmic developments on the integral closure of algebraic structures. It gives a comprehensive treatment of Rees algebras and multiplicity theory while pointing to applications in many other problem areas. Its main goal is to provide complexity estimates by tracking numerically invariants of the structures that may occur.
Many disciplines are concerned with manipulating geometric (or spatial) objects in the computer - such as geology, cartography, computer aided design (CAD), etc. - and each of these have developed their own data structures and techniques, often independently. Nevertheless, in many cases the object types and the spatial queries are similar, and this book attempts to find a common theme.
Автор: Brimkov Название: Digital Geometry Algorithms ISBN: 9400741731 ISBN-13(EAN): 9789400741737 Издательство: Springer Рейтинг: Цена: 15625 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Digital geometry emerged as an independent discipline in the second half of the last century. It deals with geometric properties of digital objects and is developed with the unambiguous goal to provide rigorous theoretical foundations for devising new advanced approaches and algorithms for various problems of visual computing. Different aspects of digital geometry have been addressed in the literature. This book is the first one that explicitly focuses on the presentation of the most important digital geometry algorithms. Each chapter provides a brief survey on a major research area related to the general volume theme, description and analysis of related fundamental algorithms, as well as new original contributions by the authors. Every chapter contains a section in which interesting open problems are addressed.
Описание: Semidefinite programs constitute one of the largest classes of optimization problems that can be solved with reasonable efficiency - both in theory and practice. They play a key role in a variety of research areas, such as combinatorial optimization, approximation algorithms, computational complexity, graph theory, geometry, real algebraic geometry and quantum computing. This book is an introduction to selected aspects of semidefinite programming and its use in approximation algorithms. It covers the basics but also a significant amount of recent and more advanced material. There are many computational problems, such as MAXCUT, for which one cannot reasonably expect to obtain an exact solution efficiently, and in such case, one has to settle for approximate solutions. For MAXCUT and its relatives, exciting recent results suggest that semidefinite programming is probably the ultimate tool. Indeed, assuming the Unique Games Conjecture, a plausible but as yet unproven hypothesis, it was shown that for these problems, known algorithms based on semidefinite programming deliver the best possible approximation ratios among all polynomial-time algorithms. This book follows the “semidefinite side” of these developments, presenting some of the main ideas behind approximation algorithms based on semidefinite programming. It develops the basic theory of semidefinite programming, presents one of the known efficient algorithms in detail, and describes the principles of some others. It also includes applications, focusing on approximation algorithms.
Автор: Dickenstein Название: Algorithms in Algebraic Geometry ISBN: 0387751548 ISBN-13(EAN): 9780387751542 Издательство: Springer Рейтинг: Цена: 13584 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: The workshop on Algorithms in Algebraic Geometry was held in the framework of the IMA Annual Program Year in Applications of Algebraic Geometry by the Institute for Mathematics and Its Applications on September 18-22, 2006 at the University of Minnesota. This title captures some of the spirit of the IMA workshop.
ООО "Логосфера " Тел:+7(495) 980-12-10 www.logobook.ru