ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
advertisementadvertisement
Journal of Algorithms
Volume 30, Issue 2, February 1999, Pages 302-322
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Purchase PDF (208 K)

 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1006/jagm.1998.0984    How to Cite or Link Using DOI (Opens New Window)
Copyright © 1999 Academic Press. All rights reserved.

Regular Article

Optimal Point Placement for Mesh Smoothing

Nina Amentaa, *, Marshall Bernb, and David Eppsteinc,

a Xerox Palo Alto Research Center, 3333 Coyote Hill Road, Palo Alto, California, 94304 b Xerox Palo Alto Research Center, 3333 Coyote Hill Road, Palo Alto, California, 94304 c Department of Information and Computer Science, University of California, Irvine, California, 92697-3425

Received 31 May 1997; 
revised 29 July 1998. 
Available online 12 April 2002.

Purchase the full-text article



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.


Journal of Algorithms
Volume 30, Issue 2, February 1999, Pages 302-322
 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.