Optimal Point Placement for Mesh Smoothing
โ Scribed by Nina Amenta; Marshall Bern; David Eppstein
- Publisher
- Elsevier Science
- Year
- 1999
- Tongue
- English
- Weight
- 209 KB
- Volume
- 30
- Category
- Article
- ISSN
- 0196-6774
No coin nor oath required. For personal study only.
โฆ Synopsis
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.
๐ SIMILAR VOLUMES
## measurements can be recovered from several views by triangulation. This paper deals with the problem of where to place the cameras in order to obtain a minimal error in the 3D measurements, also called camera network design in photogrammetry. We pose the problem in terms of an optimization desi