Delaunay mesh generation with triangle area constrains ∗
msra(2007)
摘要
We propose a framework that combines Delaunay refinement and improvement techniques for generating a refined Delaunay quality mesh of a Planar Straight Line Graph domain. Our algorithms achieve quality mesh by moving and inserting Steiner points from or into the mesh, combining the Delaunay criterion with different area-based criteria.
更多查看译文
AI 理解论文
溯源树
样例
![](https://originalfileserver.aminer.cn/sys/aminer/pubs/mrt_preview.jpeg)
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要