%{search_type} search results

9 catalog results

RSS feed for this result
1 online resource.
  • Roots of Geometry and Topology
  • Voronoi and Delaunay Diagrams
  • Weighted Diagrams
  • Three Dimensions
  • Alpha Complexes
  • Holes
  • Area Formulas
  • Topological Spaces
  • Homology Groups
  • Complex Construction
  • Filtrations
  • PL Functions
  • Matrix Reduction
  • Epilogue.
With the aim to bring the subject of Computational Geometry and Topology closer to the scientific audience, this book is written in thirteen ready-to-teach sections organized in four parts: TESSELLATIONS, COMPLEXES, HOMOLOGY, PERSISTENCE. To speak to the non-specialist, detailed formalisms are often avoided in favor of lively 2- and 3-dimensional illustrations. The book is warmly recommended to everybody who loves geometry and the fascinating world of shapes.
xii, 241 p. : ill. ; 27 cm.
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)
xii, 177 p. : ill. ; 24 cm.
  • 1. Delaunay triangulations-- 2. Triangle meshes-- 3. Combinatorial topology-- 4. Surface simplification-- 5. Delaunay tetrahedrizations-- 6. Tetrahedron meshes-- 7. Open problems.
  • (source: Nielsen Book Data)9780521793094 20160528
The book combines topics in mathematics (geometry and topology), computer science (algorithms), and engineering (mesh generation). The motivation for these topics is the difficulty, both conceptually and in the technical execution, of combining elements of combinatorial and of numerical algorithms. Mesh generation is a topic where a meaningful combination of these different approaches to problem solving is inevitable. The book develops methods from both areas that are amenable to combination, and explains recent breakthrough solutions to meshing that fit into this category. This book emphasizes topics that are elementary, attractive, useful, interesting, and lend themselves to teaching, making it an ideal graduate text for courses on mesh generation.
(source: Nielsen Book Data)9780521793094 20160528
Science Library (Li and Ma)
xv, 423 p. : ill. ; 25 cm.
Science Library (Li and Ma)
SAL3 (off-campus storage)
SAL3 (off-campus storage)
SAL3 (off-campus storage)
SAL3 (off-campus storage)
1 online resource (18 ) : digital, PDF file.


Journal articles, e-books, & other e-resources
Articles+ results include