= John L. Harer
{c}
<John L. Harer> works at the intersection of <topology>, <geometry> and computational data analysis. His Duke research description emphasizes geometric, combinatorial and computational methods for analyzing shape and data.https://scholars.duke.edu/person/john.harer[Overview, research scope]{ref} With <Herbert Edelsbrunner>, he coauthored <Computational Topology: An Introduction by Herbert Edelsbrunner and John L. Harer>, connecting topological invariants to computational methods.<Computational Topology: An Introduction by Herbert Edelsbrunner and John L. Harer>[publisher byline and scope]{ref}
An elementary illustration is a triangular outline: it has one connected component and one unfilled loop. Filling its interior keeps the connected component but removes the hole. <Homology> distinguishes these cases, showing why a description of shape can capture something different from coordinates or pairwise distances. The example illustrates the subject rather than attributing a particular theorem or discovery to the book's authors.
Back to article page
