arXiv · cs/9809081
Optimal Point Placement for Mesh Smoothing
Abstract
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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Nina Amenta, Marshall Bern, David Eppstein. 1998-09-24. Optimal Point Placement for Mesh Smoothing. https://doi.org/10.1006/jagm.1998.0984. https://searcharxiv.com/abs/cs/9809081
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.