|
About Parametric Surface MeshingBorouchaki, Houman, Patrick Laug, and Paul-Louis George2nd Symposium on Trends in Unstructured Mesh Generation, University of Colorado, Boulder, August 1999
|
|
2nd Symposium on
Trends in Unstructured Mesh Generation 5th US Congress on Computational Mechanics University of Colorado, Boulder August 4-6, 1999
INRIA, Domaine de Voluceau, Rocquencourt BP 105, 78153 Le Chesnay
Cedex, France.
Abstract A wide range of surfaces can be defined by means of composite parametric surfaces. Indeed, most of the surfaces are approximated by polynomial or rational parametric patches as it is in most of the CAD- CAM modelers. In this paper, we would like to make some remarks about a method suitable to generate a constrained mesh of a parametric patch. The constraint consists of a metric map, which prescribes a size for every direction and also a shape quality about the mesh elements. The aim is then to construct a mesh that conforms to the specifications included in the metric map and such that its elements are as regular as possible. A mesh of a parametric patch whose element vertices belong to the surface is suitable if the two following properties hold:
The first property allows us to bound the gap between the elements and the surface. This gap measures the greatest distance between an element (any point of the latter) and the surface. The second property means that the surface is locally of order G1, in terms of continuity. To obtain this, the angular gap between the element and the tangent plane at its vertices must be bounded. In this paper, we show that a mesh satisfying the two above properties conforms to a special metric map, a called geometric map. Then, we introduce a method for surface mesh generation based on a mesh construction in the parametric space in such a way as to follow the above geometric map. The flowchart of the method is as follows:
Various application examples (including what follows) are provided to illustrate the capabil-ities of the above mentioned method. (figures omitted) Contact author(s) or publisher for availability and copyright information on above referenced article |