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.

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.

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

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.