Local Optimization-based Simplicial Mesh Untangling and Improvement

@inproceedings{PLASSMANNzAbstractLocalOS,
  title={Local Optimization-based Simplicial Mesh Untangling and Improvement},
  author={PAUL PLASSMANNzAbstract}
}
  • PAUL PLASSMANNzAbstract
We present an optimization-based approach for mesh untangling that maximizes the minimum area or volume of simplicial elements in a local submesh. These functions are linear with respect to the free vertex position; thus the problem can be formulated as a linear program that is solved by using the computationally inexpensive simplex method. We prove that the function level sets are convex regardless of the position of the free vertex, and hence the local subproblem is guaranteed to converge… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-10 of 100 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 20 references

A cost / bene t analysis of simplicial mesh improvement as measured bysolution e  ciency

  • Lori Freitag, Carl Ollivier-Gooch.
  • 1998

Tristano . An approach to combinedLaplacian and optimizationbased smoothing for triangular , quadrilateral , and quaddominant meshes

  • Patrick Knupp.
  • 1998

An e  cient method to solve the minimax problem directly

  • A. Conn.
  • SIAM Journal ofNumerical Analysis
  • 1997

A method of the improvement of 3 D solid niteelement meshes

  • M. V. Hormaza, A. Hernandez, M. B. G. Ajuria
  • Advances in Engineering Software
  • 1995

Similar Papers

Loading similar papers…