Optimal point placement for mesh smoothing
Journal of Algorithms
Data structures for mobile data
Journal of Algorithms
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Reference Jacobian optimization-based rezone strategies for arbitrary Lagrangian Eulerian methods
Journal of Computational Physics
Untangling of 2D meshes in ALE simulations
Journal of Computational Physics
A Two-Dimensional Kinetic Triangulation with Near-Quadratic Topological Changes
Discrete & Computational Geometry
Maintaining deforming surface meshes
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Kinetic convex hulls and delaunay triangulations in the black-box model
Proceedings of the twenty-seventh annual symposium on Computational geometry
| Hi-index | 0.00 |
The problem of maintaining a valid mesh (triangulation) within a certain domain that deforms over time arises in many applications. During a period for which the underlying mesh topology remains unchanged, the deformation moves vertices of the mesh and thus potentially turns a mesh invalid, or as we call it, tangled. We introduce the notion of locally removable regions, which are certain tangled regions in the mesh that allow for local removal and re-meshing. We present an algorithm that is able to quickly compute, through local explorations, a minimum locally removable region containing a "seed" tangled region in an invalid mesh. By re-meshing within this area, the "seed" tangled region can then be removed from the mesh without introducing any new tangled region. The algorithm is output-sensitive in the sense that it never explores outside the output region.