首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Optimal Point Placement for Mesh Smoothing
Authors:Nina Amenta  Marshall Bern  David Eppstein  
Institution: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
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.
Keywords:
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号