This book offers an essential overview of computational conformal geometry applied to fundamental problems in specific engineering fields. It introduces readers to conformal geometry theory and discusses implementation issues from an engineering perspective. The respective chapters explore fundamental problems in specific fields of application, and detail how computational conformal geometric methods can be used to solve them in a theoretically elegant and computationally efficient way. The fields covered include computer graphics, computer vision, geometric modeling, medical imaging, and wireless sensor networks. Each chapter concludes with a summary of the material covered and suggestions for further reading, and numerous illustrations and computational algorithms complement the text. The book draws on courses given by the authors at the University of Louisiana at Lafayette, the State University of New York at Stony Brook, and Tsinghua University, and will be of interest to senior undergraduates, graduates and researchers in computer science, applied mathematics, and engineering.

This monograph presents a short course in computational geometry and topology. In the first part the book covers Voronoi diagrams and Delaunay triangulations, then it presents the theory of alpha complexes which play a crucial role in biology. The central part of the book is the homology theory and their computation, including the theory of persistence which is indispensable for applications, e.g. shape reconstruction. The target audience comprises researchers and practitioners in mathematics, biology, neuroscience and computer science, but the book may also be beneficial to graduate students of these fields.

Energy of knots is a theory that was introduced to create a "canonical configuration" of a knot - a beautiful knot which represents its knot type. This book introduces several kinds of energies, and studies the problem of whether or not there is a "canonical configuration" of a knot in each knot type. It also considers this problem in the context of conformal geometry. The energies presented in the book are defined geometrically. They measure the complexity of embeddings and have applications to physical knotting and unknotting thorough numerical experiments.

Until recently, almost all of the interactions between objects in virtual 3D worlds have been based on calculations performed using linear algebra. Linear algebra relies heavily on coordinates, however, which can make many geometric programming tasks very specific and complex-often a lot of effort is required to bring about even modest performance enhancements. Although linear algebra is an efficient way to specify low-level computations, it is not a suitable high-level language for geometric programming. Geometric Algebra for Computer Science presents a compelling alternative to the limitations of linear algebra. Geometric algebra, or GA, is a compact, time-effective, and performance-enhancing way to represent the geometry of 3D objects in computer programs. In this book you will find an introduction to GA that will give you a strong grasp of its relationship to linear algebra and its significance for your work. You will learn how to use GA to represent objects and perform geometric operations on them. And you will begin mastering proven techniques for making GA an integral part of your applications in a way that simplifies your code without slowing it down. * The first book on Geometric Algebra for programmers in computer graphics and entertainment computing * Written by leaders in the field providing essential information on this new technique for 3D graphics * This full colour book includes a website with GAViewer, a program to experiment with GA

This monograph-like anthology introduces the concepts and framework of Clifford algebra. It provides a rich source of examples of how to work with this formalism. Clifford or geometric algebra shows strong unifying aspects and turned out in the 1960s to be a most adequate formalism for describing different geometry-related algebraic systems as specializations of one "mother algebra" in various subfields of physics and engineering. Recent work shows that Clifford algebra provides a universal and powerful algebraic framework for an elegant and coherent representation of various problems occurring in computer science, signal processing, neural computing, image processing, pattern recognition, computer vision, and robotics.

The author defines “Geometric Algebra Computing” as the geometrically intuitive development of algorithms using geometric algebra with a focus on their efficient implementation, and the goal of this book is to lay the foundations for the widespread use of geometric algebra as a powerful, intuitive mathematical language for engineering applications in academia and industry. The related technology is driven by the invention of conformal geometric algebra as a 5D extension of the 4D projective geometric algebra and by the recent progress in parallel processing, and with the specific conformal geometric algebra there is a growing community in recent years applying geometric algebra to applications in computer vision, computer graphics, and robotics. This book is organized into three parts: in Part I the author focuses on the mathematical foundations; in Part II he explains the interactive handling of geometric algebra; and in Part III he deals with computing technology for high-performance implementations based on geometric algebra as a domain-specific language in standard programming languages such as C++ and OpenCL. The book is written in a tutorial style and readers should gain experience with the associated freely available software packages and applications. The book is suitable for students, engineers, and researchers in computer science, computational engineering, and mathematics.

This is a unified, tutorial description of the most widely used models of parallel computation and their application to problems in computational geometry. Each chapter offers an in-depth analysis of a problem in computational geometry and presents parallel algorithms to solve them. Comparative tables summarize the various algorithms developed to solve each problem. A wide range of models of parallel computation to develop the algorithms - parallel random access machine (PRAM) - are considered, as well as several networks for interconnecting processors on a parallel computer.

'I very much enjoyed reading this book … Each chapter comes with well thought-out exercises, solutions to which are given at the end of the chapter. Conformal Maps and Geometry presents key topics in geometric function theory and the theory of univalent functions, and also prepares the reader to progress to study the SLE. It succeeds admirably on both counts.'MathSciNetGeometric function theory is one of the most interesting parts of complex analysis, an area that has become increasingly relevant as a key feature in the theory of Schramm-Loewner evolution.Though Riemann mapping theorem is frequently explored, there are few texts that discuss general theory of univalent maps, conformal invariants, and Loewner evolution. This textbook provides an accessible foundation of the theory of conformal maps and their connections with geometry.It offers a unique view of the field, as it is one of the first to discuss general theory of univalent maps at a graduate level, while introducing more complex theories of conformal invariants and extremal lengths. Conformal Maps and Geometry is an ideal resource for graduate courses in Complex Analysis or as an analytic prerequisite to study the theory of Schramm-Loewner evolution.

The theory of vertex operator algebras and their representations has been showing its power in the solution of concrete mathematical problems and in the understanding of conceptual but subtle mathematical and physical struc- tures of conformal field theories. Much of the recent progress has deep connec- tions with complex analysis and conformal geometry. Future developments, especially constructions and studies of higher-genus theories, will need a solid geometric theory of vertex operator algebras. Back in 1986, Manin already observed in Man) that the quantum theory of (super )strings existed (in some sense) in two entirely different mathematical fields. Under canonical quantization this theory appeared to a mathematician as the representation theories of the Heisenberg, Vir as oro and affine Kac- Moody algebras and their superextensions. Quantization with the help of the Polyakov path integral led on the other hand to the analytic theory of algebraic (super ) curves and their moduli spaces, to invariants of the type of the analytic curvature, and so on.He pointed out further that establishing direct mathematical connections between these two forms of a single theory was a big and important problem. On the one hand, the theory of vertex operator algebras and their repre- sentations unifies (and considerably extends) the representation theories of the Heisenberg, Virasoro and Kac-Moody algebras and their superextensions.