Optimal Point Placement for Mesh Smoothing

Details Optimal Point Placement for Mesh Smoothing Optimal Point Placement for Mesh Smoothing

1998-09-24

arxiv.org/abs/cs/9809081v1

J. Algorithms 30 (1999) 302-322

Computer Science

Computational Geometry

12 pages, 3 figures. A preliminary version of this paper was presented at the 8th ACM/SIAM Symp. on Discrete Algorithms (SODA

Scientific paper

10.1006/jagm.1998.0984

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.

Affiliated with

Also associated with

No associations

Rating

Optimal Point Placement for Mesh Smoothing does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Optimal Point Placement for Mesh Smoothing, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Optimal Point Placement for Mesh Smoothing will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-670408