Optimal point placement for mesh smoothing
Conference
·
OSTI ID:471710
- Xerox Palo Alto Research Center, CA (United States)
- Univ. of California, Irvine, CA (United States)
We study the problem of moving a vertex in a finite element mesh to optimize the shapes of adjacent triangles. 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.
- OSTI ID:
- 471710
- Report Number(s):
- CONF-970142--; CNN: Grant CCR-9258355
- Country of Publication:
- United States
- Language:
- English
Similar Records
An efficient parallel algorithm for mesh smoothing
Local, Optimization-based Simplicial Mesh Smoothing
Local optimization-based simplicial mesh untangling and improvement.
Technical Report
·
Sat Dec 30 23:00:00 EST 1995
·
OSTI ID:414390
Local, Optimization-based Simplicial Mesh Smoothing
Software
·
Thu Dec 09 00:00:00 EST 1999
·
OSTI ID:1230612
Local optimization-based simplicial mesh untangling and improvement.
Journal Article
·
Sun Sep 10 00:00:00 EDT 2000
· Int. J. Numer. Methods Eng.
·
OSTI ID:942567