Delaunay mesh generation
Author(s)
Bibliographic Information
Delaunay mesh generation
(Chapman & Hall/CRC computer and information science series / series editor, Sartaj Sahni)
CRC Press, c2013
Available at 3 libraries
  Aomori
  Iwate
  Miyagi
  Akita
  Yamagata
  Fukushima
  Ibaraki
  Tochigi
  Gunma
  Saitama
  Chiba
  Tokyo
  Kanagawa
  Niigata
  Toyama
  Ishikawa
  Fukui
  Yamanashi
  Nagano
  Gifu
  Shizuoka
  Aichi
  Mie
  Shiga
  Kyoto
  Osaka
  Hyogo
  Nara
  Wakayama
  Tottori
  Shimane
  Okayama
  Hiroshima
  Yamaguchi
  Tokushima
  Kagawa
  Ehime
  Kochi
  Fukuoka
  Saga
  Nagasaki
  Kumamoto
  Oita
  Miyazaki
  Kagoshima
  Okinawa
  Korea
  China
  Thailand
  United Kingdom
  Germany
  Switzerland
  France
  Belgium
  Netherlands
  Sweden
  Norway
  United States of America
-
Library, Research Institute for Mathematical Sciences, Kyoto University数研
CHE||73||1200026165779
Note
Includes bibliographical references (p. 369-386) and index
Description and Table of Contents
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.
Table of Contents
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.
by "Nielsen BookData"