Delaunay Mesh Generation (Hardcover)
Siu-Wing Cheng, Tamal K. Dey, Jonathan Shewchuk
- 出版商: CRC
- 出版日期: 2012-12-14
- 售價: $3,450
- 貴賓價: 9.5 折 $3,278
- 語言: 英文
- 頁數: 410
- 裝訂: Hardcover
- ISBN: 1584887303
- ISBN-13: 9781584887300
立即出貨 (庫存 < 3)
買這商品的人也買了...
-
$1,200$948 -
$520$406 -
$680$578 -
$780$616 -
$350$263 -
$454UEFI 原理與編程
-
$880$695 -
$780$616 -
$360$284 -
$650$553 -
$620$484 -
$690$538 -
$680$537 -
$320$250 -
$520$442 -
$580$458 -
$620$484 -
$580$458 -
$520$442 -
$480$379 -
$680$537 -
$520$411 -
$880$616 -
$480$379 -
$680$537
相關主題
商品描述
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.
商品描述(中文翻譯)
由現代演算法研究的領先作者撰寫,《Delaunay網格生成》展示了Delaunay網格生成器在處理從具有內部邊界的多面體到分段平滑曲面等複雜幾何領域中的強大和多功能性。本書涵蓋了體積和表面網格,作者完整解釋了這些網格生成演算法的工作原理和原因。
本書是首批整合大量關於Delaunay三角剖分的尖端材料的著作之一。它首先介紹了網格生成問題,並描述了構建Delaunay三角剖分的演算法。接著,作者提出了在多邊形和多面體領域生成高質量網格的演算法。他們還說明了如何使用受限Delaunay三角剖分將這些演算法擴展到具有脊線和補丁的曲面以及具有平滑表面的體積。
對於研究人員和研究生,本書提供了對網格生成方法的嚴謹理論分析。它提供了必要的數學基礎和核心理論結果,為研究人員未來建立更好的演算法奠定基礎。
對於工程師,本書展示了這些演算法在實踐中的良好運作。它解釋了如何在網格生成軟體的設計和編程中有效實施它們。