Topological Algorithms

Miao Jin (), Xianfeng Gu, Ying He and Yalin Wang
Additional contact information
Miao Jin: University of Louisiana, Centre for Advanced Computer Studies
Xianfeng Gu: State University of New York
Ying He: Nanyang Technological University, School of Computer Science and Engineering
Yalin Wang: Arizona State University, School of Computing, Informatics and Decision Systems Engineering

Chapter Chapter 2 in Conformal Geometry, 2018, pp 11-18 from Springer

Abstract: 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.

Date: 2018
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-319-75332-4_2

Ordering information: This item can be ordered from
http://www.springer.com/9783319753324

DOI: 10.1007/978-3-319-75332-4_2

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().