This welcome boon for students of algebraic topology cuts a much- needed central path between other texts whose treatment of the classification theorem for compact surfaces is either too formalized and complex for those without detailed background knowledge, or too informal to afford students a comprehensive insight into the subject. Its dedicated, student-centred approach details a near-complete proof of this theorem, widely admired for its efficacy and formal beauty. The authors present the technical tools needed to deploy the method effectively as well as demonstrating their use in a clearly structured, worked example. Ideal for students whose mastery of algebraic topology may be a work-in-progress, the text introduces key notions such as fundamental groups, homology groups, and the Euler-Poincar characteristic. These prerequisites are the subject of detailed appendices that enable focused, discrete learning where it is required, without interrupting the carefully planned structure of the core exposition. Gently guiding readers through the principles, theory, and applications of the classification theorem, the authors aim to foster genuine confidence in its use and in so doing encourage readers to move on to a deeper exploration of the versatile and valuable techniques available in algebraic topology.

This book is an introduction to the fundamental concepts and tools needed for solving problems of a geometric nature using a computer. It attempts to fill the gap between standard geometry books, which are primarily theoretical, and applied books on computer graphics, computer vision, robotics, or machine learning.

This book covers the following topics: affine geometry, projective geometry, Euclidean geometry, convex sets, SVD and principal component analysis, manifolds and Lie groups, quadratic optimization, basics of differential geometry, and a glimpse of computational geometry (Voronoi diagrams and Delaunay triangulations). Some practical applications of the concepts presented in this book include computer vision, more specifically contour grouping, motion interpolation, and robot kinematics.

In this extensively updated second edition, more material on convex sets, Farkas's lemma, quadratic optimization and the Schur complement have been added. The chapter on SVD has been greatly expanded and now includes a presentation of PCA.

The book is well illustrated and has chapter summaries and a large number of exercises throughout. It will be of interest to a wide audience including computer scientists, mathematicians, and engineers.

Reviews of first edition:

"Gallier's book will be a useful source for anyone interested in applications of geometrical methods to solve problems that arise in various branches of engineering. It may help to develop the sophisticated concepts from the more advanced parts of geometry into useful tools for applications." (Mathematical Reviews, 2001)

..".it will be useful as a reference book for postgraduates wishing to find the connection between their current problem and the underlying geometry." (The Australian Mathematical Society, 2001)"

This welcome boon for students of algebraic topology cuts a much-needed central path between other texts whose treatment of the classification theorem for compact surfaces is either too formalized and complex for those without detailed background knowledge, or too informal to afford students a comprehensive insight into the subject. Its dedicated, student-centred approach details a near-complete proof of this theorem, widely admired for its efficacy and formal beauty. The authors present the technical tools needed to deploy the method effectively as well as demonstrating their use in a clearly structured, worked example. Ideal for students whose mastery of algebraic topology may be a work-in-progress, the text introduces key notions such as fundamental groups, homology groups, and the Euler-Poincare characteristic. These prerequisites are the subject of detailed appendices that enable focused, discrete learning where it is required, without interrupting the carefully planned structure of the core exposition. Gently guiding readers through the principles, theory, and applications of the classification theorem, the authors aim to foster genuine confidence in its use and in so doing encourage readers to move on to a deeper exploration of the versatile and valuable techniques available in algebraic topology.

This book is an introduction to the fundamental concepts and tools needed for solving problems of a geometric nature using a computer. It attempts to fill the gap between standard geometry books, which are primarily theoretical, and applied books on computer graphics, computer vision, robotics, or machine learning. This book covers the following topics: affine geometry, projective geometry, Euclidean geometry, convex sets, SVD and principal component analysis, manifolds and Lie groups, quadratic optimization, basics of differential geometry, and a glimpse of computational geometry (Voronoi diagrams and Delaunay triangulations). Some practical applications of the concepts presented in this book include computer vision, more specifically contour grouping, motion interpolation, and robot kinematics. In this extensively updated second edition, more material on convex sets, Farkas's lemma, quadratic optimization and the Schur complement have been added. The chapter on SVD has been greatly expanded and now includes a presentation of PCA. The book is well illustrated and has chapter summaries and a large number of exercises throughout. It will be of interest to a wide audience including computer scientists, mathematicians, and engineers. Reviews of first edition: "Gallier's book will be a useful source for anyone interested in applications of geometrical methods to solve problems that arise in various branches of engineering. It may help to develop the sophisticated concepts from the more advanced parts of geometry into useful tools for applications." (Mathematical Reviews, 2001) "...it will be useful as a reference book for postgraduates wishing to find the connection between their current problem and the underlying geometry." (The Australian Mathematical Society, 2001)

This textbook explores advanced topics in differential geometry, chosen for their particular relevance to modern geometry processing. Analytic and algebraic perspectives augment core topics, with the authors taking care to motivate each new concept. Whether working toward theoretical or applied questions, readers will appreciate this accessible exploration of the mathematical concepts behind many modern applications. Beginning with an in-depth study of tensors and differential forms, the authors go on to explore a selection of topics that showcase these tools. An analytic theme unites the early chapters, which cover distributions, integration on manifolds and Lie groups, spherical harmonics, and operators on Riemannian manifolds. An exploration of bundles follows, from definitions to connections and curvature in vector bundles, culminating in a glimpse of Pontrjagin and Chern classes. The final chapter on Clifford algebras and Clifford groups draws the book to an algebraic conclusion, which can be seen as a generalized viewpoint of the quaternions. Differential Geometry and Lie Groups: A Second Course captures the mathematical theory needed for advanced study in differential geometry with a view to furthering geometry processing capabilities. Suited to classroom use or independent study, the text will appeal to students and professionals alike. A first course in differential geometry is assumed; the authors' companion volume Differential Geometry and Lie Groups: A Computational Perspective provides the ideal preparation.

This books gives an introduction to discrete mathematics for beginning undergraduates. One of original features of this book is that it begins with a presentation of the rules of logic as used in mathematics. Many examples of formal and informal proofs are given. With this logical framework firmly in place, the book describes the major axioms of set theory and introduces the natural numbers. The rest of the book is more standard. It deals with functions and relations, directed and undirected graphs, and an introduction to combinatorics. There is a section on public key cryptography and RSA, with complete proofs of Fermat's little theorem and the correctness of the RSA scheme, as well as explicit algorithms to perform modular arithmetic. The last chapter provides more graph theory. Eulerian and Hamiltonian cycles are discussed. Then, we study flows and tensions and state and prove the max flow min-cut theorem. We also discuss matchings, covering, bipartite graphs.