Optimal point placement for mesh smoothing

被引：59

作者：

Amenta, N

Bern, M

Eppstein, D

机构：

[1] Xerox Corp, Palo Alto Res Ctr, Palo Alto, CA 94304 USA

[2] Univ Calif Irvine, Dept Informat & Comp Sci, Irvine, CA 92697 USA

来源：

JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC | 1999年 / 30卷 / 02期

基金：

美国国家科学基金会;

关键词：

D O I：

10.1006/jagm.1998.0984

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

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. (C) 1999 Academic Press.

引用

页码：302 / 322

页数：21

共 35 条

[1] A RANDOMIZED SCHEME FOR SPEEDING-UP ALGORITHMS FOR LINEAR AND CONVEX-PROGRAMMING PROBLEMS WITH HIGH CONSTRAINTS-TO-VARIABLES RATIO [J].