Optimal Point Placement for Mesh Smoothing
计算几何
2010-01-21 v1
摘要
We study the problem of moving a vertex in an unstructured mesh of triangular, quadrilateral, or tetrahedral elements to optimize the shapes of adjacent elements. We show that many such problems can be solved in linear time using generalized linear programming. We also give efficient algorithms for some mesh smoothing problems that do not fit into the generalized linear programming paradigm.
引用
@article{arxiv.cs/9809081,
title = {Optimal Point Placement for Mesh Smoothing},
author = {Nina Amenta and Marshall Bern and David Eppstein},
journal= {arXiv preprint arXiv:cs/9809081},
year = {2010}
}
备注
12 pages, 3 figures. A preliminary version of this paper was presented at the 8th ACM/SIAM Symp. on Discrete Algorithms (SODA '97). This is the final version, and will appear in a special issue of J. Algorithms for papers from SODA '97