We describe some extensions to the grid smoothing scheme described in [1, 2] that deal with the following issues: 1) the clustering effect of changing valence in an unstructured ...
We introduce an indexing scheme for the vertices of semi-regular meshes, based on interleaving quadtrees rooted on the edges of the base mesh. Using this indexing scheme we develo...
This paper presents an automated tool for local, conformal refinement of all-hexahedral meshes based on the insertion of multidirectional twist planes into the spatial twist conti...
Nathan J. Harris, Steven E. Benzley, Steven J. Owe...
The Delaunay Refinement Algorithm for quality meshing is extended to three dimensions. The algorithm accepts input with arbitrarily small angles, and outputs a Conforming Delauna...
This paper presents a technique for the adaptive refinement of tetrahedral meshes. What makes it unique is that no neighbor information is required for the refined mesh to be co...