Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Z .Journal of Algorithms 30, 302 322 1999 Article ID jagm.1998.0984, available online at http:rrwww.idealibrary.com on
 

Summary: Z .Journal of Algorithms 30, 302 322 1999
Article ID jagm.1998.0984, available online at http:rrwww.idealibrary.com on
Optimal Point Placement for Mesh Smoothing
Nina Amenta*
Xerox Palo Alto Research Center, 3333 Coyote Hill Road, Palo Alto, California 94304
Marshall Bern
Xerox Palo Alto Research Center, 3333 Coyote Hill Road, Palo Alto, California 94304
and
David Eppstein
Department of Information and Computer Science, Unišersity of California,
Iršine, California 92697-3425
Received May 31, 1997; revised July 29, 1998
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.
1999 Academic Press
1. INTRODUCTION
Unstructured mesh generation, a key step in the finite element method,

  

Source: Amenta, Nina - Department of Computer Science, University of California, Davis

 

Collections: Biology and Medicine; Computer Technologies and Information Sciences