
Delaunay Mesh Generation
Algorithms and Mathematical Analysis
Chapman & Hall/CRC (Publisher)
1st Edition
Published on 4. December 2012
Book
Hardback
410 pages
978-1-58488-730-0 (ISBN)
Description
Written by authors at the forefront of modern algorithms research, Delaunay Mesh Generation demonstrates the power and versatility of Delaunay meshers in tackling complex geometric domains ranging from polyhedra with internal boundaries to piecewise smooth surfaces. Covering both volume and surface meshes, the authors fully explain how and why these meshing algorithms work.
The book is one of the first to integrate a vast amount of cutting-edge material on Delaunay triangulations. It begins with introducing the problem of mesh generation and describing algorithms for constructing Delaunay triangulations. The authors then present algorithms for generating high-quality meshes in polygonal and polyhedral domains. They also illustrate how to use restricted Delaunay triangulations to extend the algorithms to surfaces with ridges and patches and volumes with smooth surfaces.
For researchers and graduate students, the book offers a rigorous theoretical analysis of mesh generation methods. It provides the necessary mathematical foundations and core theoretical results upon which researchers can build even better algorithms in the future.
For engineers, the book shows how the algorithms work well in practice. It explains how to effectively implement them in the design and programming of mesh generation software.
The book is one of the first to integrate a vast amount of cutting-edge material on Delaunay triangulations. It begins with introducing the problem of mesh generation and describing algorithms for constructing Delaunay triangulations. The authors then present algorithms for generating high-quality meshes in polygonal and polyhedral domains. They also illustrate how to use restricted Delaunay triangulations to extend the algorithms to surfaces with ridges and patches and volumes with smooth surfaces.
For researchers and graduate students, the book offers a rigorous theoretical analysis of mesh generation methods. It provides the necessary mathematical foundations and core theoretical results upon which researchers can build even better algorithms in the future.
For engineers, the book shows how the algorithms work well in practice. It explains how to effectively implement them in the design and programming of mesh generation software.
More details
Series
Language
English
Place of publication
Oxford
United States
Publishing group
Taylor & Francis Inc
Target group
Professional and scholarly
Professional
Illustrations
173 s/w Abbildungen
173 Illustrations, black and white
Dimensions
Height: 254 mm
Width: 178 mm
Weight
1000 gr
ISBN-13
978-1-58488-730-0 (9781584887300)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Classification
Other editions
Additional editions

Siu-Wing Cheng | Tamal K. Dey | Jonathan Shewchuk
Delaunay Mesh Generation
E-Book
04/2016
1st Edition
Chapman & Hall/CRC
€73.99
Available for download

Siu-Wing Cheng | Tamal K. Dey | Jonathan Shewchuk
Delaunay Mesh Generation
E-Book
04/2016
Chapman and Hall
€73.99
Available for download
Persons
Siu-Wing Cheng is a professor in the Department of Computer Science and Engineering at the Hong Kong University of Science and Technology. Professor Cheng is an advisory committee member of the International Symposium on Algorithms and Computation and a board member of the Asian Association for Algorithms and Computation. His research interests include computational geometry, mesh generation, manifold reconstruction, and algorithms. He earned a Ph.D. in computer science from the University of Minnesota, Twin Cities.
Tamal K. Dey is a professor of computer science at Ohio State University, where he leads the Jyamiti group, which develops software such as the well-known Cocone software for surface reconstruction and DelPSC software for mesh generation. He previously held faculty positions at Indiana University-Purdue University and IIT Kharagpur and research positions at the University of Illinois and Max-Planck Institute. His research interests include computational geometry and topology and their applications in graphics and geometric modeling. He earned a Ph.D. from Purdue University.
Jonathan Shewchuk is a professor in the Department of Electrical Engineering and Computer Sciences at the University of California, Berkeley. He is best known for his Triangle software for high-quality triangular mesh generation, which won the 2003 James Hardy Wilkinson Prize in Numerical Software, and his paper "Introduction to the Conjugate Gradient Method without the Agonizing Pain." He received his Ph.D. in computer science from Carnegie Mellon University.
Tamal K. Dey is a professor of computer science at Ohio State University, where he leads the Jyamiti group, which develops software such as the well-known Cocone software for surface reconstruction and DelPSC software for mesh generation. He previously held faculty positions at Indiana University-Purdue University and IIT Kharagpur and research positions at the University of Illinois and Max-Planck Institute. His research interests include computational geometry and topology and their applications in graphics and geometric modeling. He earned a Ph.D. from Purdue University.
Jonathan Shewchuk is a professor in the Department of Electrical Engineering and Computer Sciences at the University of California, Berkeley. He is best known for his Triangle software for high-quality triangular mesh generation, which won the 2003 James Hardy Wilkinson Prize in Numerical Software, and his paper "Introduction to the Conjugate Gradient Method without the Agonizing Pain." He received his Ph.D. in computer science from Carnegie Mellon University.
Author
Hong Kong University of Science and Technology, Hong Kong
The Ohio State University, Columbus, USA
University of California, Berkeley, USA
Content
Introduction. Two-Dimensional Delaunay Triangulations. Algorithms for Constructing Delaunay Triangulations. Three-Dimensional Delaunay Triangulations. Algorithms for Constructing Delaunay Triangulations in R3. Delaunay Refinement in the Plane. Voronoi Diagrams and Weighted Complexes. Tetrahedral Meshing of PLCs. Weighted Delaunay Refinement for PLCs with Small Angles. Sliver Exudation. Refinement for Sliver Exudation. Smooth Surfaces and Point Samples. Restricted Delaunay Triangulations of Surface Samples. Meshing Smooth Surfaces and Volumes. Meshing Piecewise Smooth Complexes. Bibliography. Index.