Optimal Point Placement for Mesh Smoothing
Preprint
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.Keywords
All Related Versions
- Version 1, 1998-09-24, ArXiv
- Published version: Journal of Algorithms, 30 (2), 302.
This publication has 18 references indexed in Scilit:
- A subexponential bound for linear programmingAlgorithmica, 1996
- Helly-type theorems and Generalized Linear ProgrammingDiscrete & Computational Geometry, 1994
- Approximating the minimum weight steiner triangulationDiscrete & Computational Geometry, 1994
- Randomized incremental construction of abstract Voronoi diagramsComputational Geometry, 1993
- A randomized scheme for speeding up algorithms for linear and convex programming problems with high constraints-to-variables ratioMathematical Programming, 1993
- On the construction of abstract voronoi diagramsDiscrete & Computational Geometry, 1991
- Minimum energy triangulations for elliptic problemsComputer Methods in Applied Mechanics and Engineering, 1990
- Data Dependent Triangulations for Piecewise Linear InterpolationIMA Journal of Numerical Analysis, 1990
- A randomized algorithm for fixed-dimensional linear programmingMathematical Programming, 1989
- The algebraic degree of geometric optimization problemsDiscrete & Computational Geometry, 1988