= Herbert Edelsbrunner
{c}
<Herbert Edelsbrunner> develops <algorithms> for <computational geometry> and <computational topology>. His research account describes a progression from <data structures> and geometry to topological methods, guided by applications.https://pub.ista.ac.at/~edels/[Biographical Information and research description]{ref} He coauthored <Computational Topology: An Introduction by Herbert Edelsbrunner and John L. Harer> with <John L. Harer>.<Computational Topology: An Introduction by Herbert Edelsbrunner and John L. Harer>[publisher byline and scope]{ref}
A central computational challenge is to replace a continuous shape by finite combinatorial data while preserving the invariant being studied. For example, a triangulated surface can be described by vertices, edges and faces, allowing <homology> to be computed from boundary relations. The representation supplies an algorithmic route to a geometric question; the quality of the input model remains part of interpreting the answer.
\Image[https://pub.ista.ac.at/~edels/Gifs/herbert.gif]
{title=Portrait of <Herbert Edelsbrunner>}
{source=https://pub.ista.ac.at/~edels/}
{width=220}
Back to article page
