This book combines mathematics (geometry and topology), computer science (algorithms), and engineering (mesh generation) in order to solve the conceptual and technical problems in the combining of elements of combinatorial and numerical algorithms. The book develops methods from areas that are amenable to combination and explains recent breakthrough solutions to meshing that fit into this category. It should be an ideal graduate text for courses on mesh generation. The specific material is selected giving preference to topics that are elementary, attractive, lend themselves to teaching, are...

Computational geometry as an area of research in its own right emerged in the early seventies of this century. Right from the beginning, it was obvious that strong connections of various kinds exist to questions studied in the considerably older field of combinatorial geometry. For example, the combinatorial structure of a geometric problem usually decides which algorithmic method solves the problem most efficiently. Furthermore, the analysis of an algorithm often requires a great deal of combinatorial knowledge. As it turns out, however, the connection between the two research areas commonly...

This book combines mathematics (geometry and topology), computer science (algorithms), and engineering (mesh generation) in order to solve the conceptual and technical problems in the combining of elements of combinatorial and numerical algorithms. The book develops methods from areas that are amenable to combination and explains recent breakthrough solutions to meshing that fit into this category. It should be an ideal graduate text for courses on mesh generation. The specific material is selected giving preference to topics that are elementary, attractive, lend themselves to teaching, are...

Computational geometry as an area of research in its own right emerged in the early seventies of this century. Right from the beginning, it was obvious that strong connections of various kinds exist to questions studied in the considerably older field of combinatorial geometry. For example, the combinatorial structure of a geometric problem usually decides which algorithmic method solves the problem most efficiently. Furthermore, the analysis of an algorithm often requires a great deal of combinatorial knowledge. As it turns out, however, the connection between the two research areas commonly...

This monograph presents a short course in computational geometry and topology. In the first part the book covers Voronoi diagrams and Delaunay triangulations, then it presents the theory of alpha complexes which play a crucial role in biology. The central part of the book is the homology theory and their computation, including the theory of persistence which is indispensable for applications, e.g. shape reconstruction. The target audience comprises researchers and practitioners in mathematics, biology, neuroscience and computer science, but the book may also be beneficial to graduate students...

A collection of articles in theoretical computer science, written by leading authorities in the field. The topics range from algorithms and complexity to algebraic specifications, and from formal languages and language-theoretic modelling to computational geometry.