Advertisement

Topological Algorithms

  • Miao Jin
  • Xianfeng Gu
  • Ying He
  • Yalin Wang
Chapter

Abstract

This chapter introduces halfedge data structure, a commonly used data structure in geometric software to efficiently represent piecewise linear triangular meshes, fundamental topological concepts and corresponding computational algorithms including cut graph, fundamental domain, homotopy, homology group basis, and canonical homotopy group generators.

Copyright information

© Springer International Publishing AG, part of Springer Nature 2018

Authors and Affiliations

  1. 1.Centre for Advanced Computer StudiesUniversity of LouisianaLafayetteUSA
  2. 2.State University of New YorkStony BrookUSA
  3. 3.School of Computer Science and EngineeringNanyang Technological UniversitySingaporeSingapore
  4. 4.School of Computing, Informatics and Decision Systems EngineeringArizona State UniversityTempeUSA

Personalised recommendations