Copyright © 1999 Academic Press. All rights reserved.
Regular Article
Optimal Point Placement for Mesh Smoothing
Received 31 May 1997;
References and further reading may be available for this article. To view references and further reading you must purchase this article.
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 smooth ing problems that do not fit into the generalized linear programming paradigm.







E-mail Article
Add to my Quick Links

Cited By in Scopus (22)

-optimality search direction based on the interior point method to start an initial basic feasible solution near the optimal point for the simplex method.


