Regular Article
Regridding Surface Triangulations

https://doi.org/10.1006/jcph.1996.0115Get rights and content

Abstract

An advancing front surface gridding technique that operates on discretely defined surfaces (i.e. triangulations) is presented. Different aspects that are required to make the procedure reliable for complex geometries are discussed. Notable among these are (a) the recovery of surface features and discrete surface patches from the discrete data, (b) filtering based on point and side-normals to remove undesirable data close to cusps and corners, (c) the proper choice of host faces for ridges, and (d) fast interpolation procedures suitable for complex geometries. Post-generation surface recovery or repositioning techniques are discussed. Several examples ranging from academic to industrial demonstrate the utility of the proposed procedure forab initiosurface meshing from discrete data, such as those encountered when the surface description is already given as discrete, the improvement of existing surface triangulations, as well as remeshing applications during runs exhibiting significant change of domain.

References (0)

Cited by (166)

  • Parallel meshing of surfaces represented by collections of connected regions

    2017, Advances in Engineering Software
    Citation Excerpt :

    Usually, each face is geometrically represented by a parametric mapping (NURBS for instance) and topologically linked with its neighbors. In a previous communication at PARENG 2011 conference [7], we have shown that methods working directly in the tridimensional space (octree [8], advancing-front [9] or paving [10]) are rather difficult to parallelize. On the other hand, we have presented an indirect approach, in which an anisotropic mesh of each bidimensional parametric domain is created and mapped to the surface.

  • On the 'most normal' normal - Part 2

    2015, Finite Elements in Analysis and Design
    Citation Excerpt :

    Each triangle carries unambiguously a face normal, but some ambiguity may arise when defining a normal at the vertices or at the edges of the triangulation. Point normals are usually required in visualization [2], rendering [3], medical applications, boundary conditions in finite volume and finite elements solvers [4], free surface problems [5], coupled fluid-structure problems [6], tangent plane computations, curvature estimations [7,8], surface to surface interpolation [9], and so forth. One strategy to tackle the point normal computation is to consider the triangles as a discretization of a smooth surface.

View all citing articles on Scopus
View full text