Author: Yang Qin
Publisher:
Publish Date: 2005-09-01
Features: The grid partitioning algorithm primarily studies methods for discretizing spatial objects or regions into a set of simple geometric simplices. Delaunay triangulation/tetrahedral partitioning is one of the important partitioning techniques, while constrained Delaunay triangulation has always been an unresolved issue. This book provides a systematic and comprehensive introduction to constrained Delaunay triangulation techniques in two-dimensional planes and three-dimensional spaces. It presents effective algorithms that can complete constrained Delaunay triangulation and mesh optimization under arbitrary point, line segment, and planar constraints, and demonstrates the validity of the algorithms. This book can serve as a reference for technical personnel in fields such as computer science and for university teachers and students.
Limited Delaunay triangular mesh partitioning technology
📌 Related Posts
Literature
Modern Tourism Food and Beverage Service Enterprise Accounting Practice
2026-09-22
Literature
"The Journey of the Swallow"
2026-09-15
Literature
Color Notes 3 -- The Blue Book
2026-09-15
Literature
Write and Wipe Practice Book Math
2026-09-22
Literature
Detailed Explanation of English, Japanese, and Chinese Flat Panel Display Technology Terminology
2026-09-30
Literature
Visual Basic .NET Programming Bible
2026-09-30
Literature
Jump Over Canada: Successful Cases of Federal Skilled Immigration
2026-09-30
Literature
First line of defense: Don't touch my computer
2026-09-30