On The Topology of Polygonal Meshes
Andreas Bærentzen
TL;DR
This paper presents an accessible treatment of polygonal-mesh topology tailored for visual computing. It distinguishes intrinsic versus extrinsic topology, and derives key quantitative invariants (s, g, b) and Betti numbers from the Euler's formula without invoking full homology. It outlines practical procedures for identifying cycles, verifying manifoldness, computing the Euler characteristic, and constructing a cut graph to flatten genusier meshes. The work emphasizes algorithmic approaches and provides connections to algebraic topology while remaining computationally tangible.
Abstract
This paper is an introductory and informal exposition on the topology of polygonal meshes. We begin with a broad overview of topological notions and discuss how homeomorphisms, homotopy, and homology can be used to characterize topology. We move on to define polygonal meshes and make a distinction between intrinsic topology and extrinsic topology which depends on the embedding space. A distinction is also made between quantitative topological properties and qualitative properties. We outline a proof of the Euler and the Euler-Poincaré formulas. The Betti numbers are defined in terms of the Euler-Poincaré formula and other mesh statistics rather than as cardinalities of the homology groups which allows us to avoid abstract algebra. Finally, we discuss how it is possible to cut a polygonal mesh such that it becomes a topological disc.
