1  5
Number of results to display per page
 Zomorodian, Afra J., 1974
 Cambridge, UK ; New York : Cambridge University Press, 2005.
 Description
 Book — xiii, 243 p. : ill. (some col.).
 Lins, Sóstenes.
 Singapore ; River Edge, N.J. : World Scientific Pub. Co., c1995.
 Description
 Book — xiv, 450 p. : ill.
 Summary

 Part 1 Basic theory: Egraphs  special celldecomposition of 2manifolds crystallizations  the FerriGagliardi moves diagrams of Egraphs and Ferri's switching lemma. Part 2 Generating surgery moves: quadricolours, hinges, commuters relations among the generating moves connections with Lickorish's construction. Part 3 Invariants: the fundamental and the homology groups the vertex group ... is there something new here? linking invariants. Part 4 Classes of 3gems: the "planar" class and lens spaces gists  special symmetries on 3manifolds. Part 5 Theory for a catalogue of 3gems: shortcuts for inserting the 4th colour the TSmoves and the Umove. Appendices: all 3gems up to 28 vertices. (Part Contents).
 (source: Nielsen Book Data)9789810219079 20160614
(source: Nielsen Book Data)9789810219079 20160614
3. Topology for computing [2005]
 Zomorodian, Afra J., 1974
 Cambridge, UK ; New York : Cambridge University Press, 2005.
 Description
 Book — xiii, 243 p. : ill. (some col.) ; 24 cm.
 Summary

 1. Introduction Part I. Mathematics: 2. Spaces and filtrations 3. Group theory 4. Homology 5. Morse theory 6. New results Part II. Algorithms: 7. The persistence algorithms 8. Topological simplification 9. The MorseSmale algorithm 10. The linking number algorithm Part III. Applications: 11. Software 12. Experiments 13. Applications.
 (source: Nielsen Book Data)9780521836661 20160528
(source: Nielsen Book Data)9780521836661 20160528
 Online
Science Library (Li and Ma)
Science Library (Li and Ma)  Status 

Stacks  
QA611 .Z65 2005  Unknown 
4. Computational topology : an introduction [2010]
 Edelsbrunner, Herbert.
 Providence, R.I. : American Mathematical Society, c2010.
 Description
 Book — xii, 241 p. : ill. ; 27 cm.
 Summary

Combining concepts from topology and algorithms, this book delivers what its title promises: an introduction to the field of computational topology. Starting with motivating problems in both mathematics and computer science and building up from classic topics in geometric and algebraic topology, the third part of the text advances to persistent homology. This point of view is critically important in turning a mostly theoretical field of mathematics into one that is relevant to a multitude of disciplines in the sciences and engineering. The main approach is the discovery of topology through algorithms. The book is ideal for teaching a graduate or advanced undergraduate course in computational topology, as it develops all the background of both the mathematical and algorithmic aspects of the subject from first principles. Thus the text could serve equally well in a course taught in a mathematics department or computer science department.
(source: Nielsen Book Data)9780821849255 20160604
Science Library (Li and Ma)
Science Library (Li and Ma)  Status 

Stacks  
QA611 .E353 2010  Unknown 
5. Computers in geometry and topology [1989]
 New York : M. Dekker, c1989.
 Description
 Book — viii, 317 p. : ill. ; 25 cm.
 Online
SAL3 (offcampus storage)
SAL3 (offcampus storage)  Status 

Stacks  Request 
QA448 .D38 C67 1989  Available 
Articles+
Journal articles, ebooks, & other eresources
 Articles+ results include