*An Introduction*

**Author**: Herbert Edelsbrunner

**Publisher:** American Mathematical Soc.

**ISBN:**

**Category:** Mathematics

**Page:** 241

**View:** 744

Combining concepts from topology and algorithms, this book delivers what its title promises: an introduction to the field of computational topology. Starting with motivating problems in both mathematics and computer science and building up from classic topics in geometric and algebraic topology, the third part of the text advances to persistent homology. This point of view is critically important in turning a mostly theoretical field of mathematics into one that is relevant to a multitude of disciplines in the sciences and engineering. The main approach is the discovery of topology through algorithms. The book is ideal for teaching a graduate or advanced undergraduate course in computational topology, as it develops all the background of both the mathematical and algorithmic aspects of the subject from first principles. Thus the text could serve equally well in a course taught in a mathematics department or computer science department.

What is the shape of data? How do we describe flows? Can we count by integrating? How do we plan with uncertainty? What is the most compact representation? These questions, while unrelated, become similar when recast into a computational setting. Our input is a set of finite, discrete, noisy samples that describes an abstract space. Our goal is to compute qualitative features of the unknown space. It turns out that topology is sufficiently tolerant to provide us with robust tools. This volume is based on lectures delivered at the 2011 AMS Short Course on Computational Topology, held January 4-5, 2011 in New Orleans, Louisiana. The aim of the volume is to provide a broad introduction to recent techniques from applied and computational topology. Afra Zomorodian focuses on topological data analysis via efficient construction of combinatorial structures and recent theories of persistence. Marian Mrozek analyzes asymptotic behavior of dynamical systems via efficient computation of cubical homology. Justin Curry, Robert Ghrist, and Michael Robinson present Euler Calculus, an integral calculus based on the Euler characteristic, and apply it to sensor and network data aggregation. Michael Erdmann explores the relationship of topology, planning, and probability with the strategy complex. Jeff Erickson surveys algorithms and hardness results for topological optimization problems.

Based on the first Workshop for Women in Computational Topology that took place in 2016, this volume assembles new research and applications in computational topology. Featured articles range over the breadth of the discipline, including topics such as surface reconstruction, topological data analysis, persistent homology, algorithms, and surface-embedded graphs. Applications in graphics, medical imaging, and GIS are discussed throughout the book. Four of the papers in this volume are the product of working groups that were established and developed during the workshop. Additional papers were also solicited from the broader Women in Computational Topology network. The volume is accessible to a broad range of researchers, both within the field of computational topology and in related disciplines such as statistics, computational biology, and machine learning.

This book constitutes the proceedings of the 4th International Workshop on Computational Topology in Image Context, CTIC 2012, held in Bertinoro, Italy, in May 2012. The 16 papers presented in this volume were carefully reviewed and selected for inclusion in this book. They focus on the topology and computation in image context. The workshop is devoted to computational methods using topology for the analysis and comparison of images. The involved research fields comprise computational topology and geometry, discrete topology and geometry, geometrical modeling, algebraic topology for image applications, and any other field involving a geometric-topological approach to image processing.

This book constitutes the proceedings of the 6th International Workshop on Computational Topology in Image Context, CTIC 2016, held in Marseille, France, in June 2016. The 24 papers presented in this volume were carefully reviewed and selected from 35 submissions. Additionally, this volume contains 2 invited papers. CTIC covers a wide range of topics such as: topological invariants and their computation, homology, cohomology, linking number, fundamental groups; algorithm optimization in discrete geometry, transfer of mathematical tools, parallel computation in multi-dimensional volume context, hierarchical approaches; experimental evaluation of algorithms and heuristics; combinatorial or multi-resolution models; discrete or computational topology; geometric modeling guided by topological constraints; computational topological dynamics; and use of topological information in discrete geometry applications.

This book constitutes the proceedings of the 7th International Workshop on Computational Topology in Image Context, CTIC 2019, held in Málaga, Spain, in January 2019. The 14 papers presented in this volume were carefully reviewed and selected from 21 submissions. Papers deal with theoretical issues but most of them put the attention on the applicability of concepts and algorithms. These were designed to deal with objects and images, but also with the speech signal. The final application must be for instance in the medical domain or in the robotics one.

While high-quality books and journals in this field continue to proliferate, none has yet come close to matching the Handbook of Discrete and Computational Geometry, which in its first edition, quickly became the definitive reference work in its field. But with the rapid growth of the discipline and the many advances made over the past seven years, it's time to bring this standard-setting reference up to date. Editors Jacob E. Goodman and Joseph O'Rourke reassembled their stellar panel of contributors, added manymore, and together thoroughly revised their work to make the most important results and methods, both classic and cutting-edge, accessible in one convenient volume. Now over more then 1500 pages, the Handbook of Discrete and Computational Geometry, Second Edition once again provides unparalleled, authoritative coverage of theory, methods, and applications. Highlights of the Second Edition: Thirteen new chapters: Five on applications and others on collision detection, nearest neighbors in high-dimensional spaces, curve and surface reconstruction, embeddings of finite metric spaces, polygonal linkages, the discrepancy method, and geometric graph theory Thorough revisions of all remaining chapters Extended coverage of computational geometry software, now comprising two chapters: one on the LEDA and CGAL libraries, the other on additional software Two indices: An Index of Defined Terms and an Index of Cited Authors Greatly expanded bibliographies

This book covers combinatorial data structures and algorithms, algebraic issues in geometric computing, approximation of curves and surfaces, and computational topology. Each chapter fully details and provides a tutorial introduction to important concepts and results. The focus is on methods which are both well founded mathematically and efficient in practice. Coverage includes references to open source software and discussion of potential applications of the presented techniques.

The emerging field of computational topology utilizes theory from topology and the power of computing to solve problems in diverse fields. Recent applications include computer graphics, computer-aided design (CAD), and structural biology, all of which involve understanding the intrinsic shape of some real or abstract space. A primary goal of this book is to present basic concepts from topology and Morse theory to enable a non-specialist to grasp and participate in current research in computational topology. The author gives a self-contained presentation of the mathematical concepts from a computer scientist's point of view, combining point set topology, algebraic topology, group theory, differential manifolds, and Morse theory. He also presents some recent advances in the area, including topological persistence and hierarchical Morse complexes. Throughout, the focus is on computational challenges and on presenting algorithms and data structures when appropriate.