We present an unstructured triangular mesh generation algorithm that approximates a set of mutually nonintersecting simple trimmed polynomial parametric surface patches within a user specified geometric tolerance. The proposed method uses numerically robust interval geometric representations/computa
Approximate development of trimmed patches for surface tessellation
โ Scribed by Wonjoon Cho; Nicholas M Patrikalakis; Jaime Peraire
- Publisher
- Elsevier Science
- Year
- 1998
- Tongue
- English
- Weight
- 748 KB
- Volume
- 30
- Category
- Article
- ISSN
- 0010-4485
No coin nor oath required. For personal study only.
โฆ Synopsis
This paper presents a method for constructing an auxiliary planar domain of triangulation for tessellating trimmed parametric surface patches. By minimizing a mapping error function, an approximate locally isometric mapping between a given trimmed parametric surface patch and its triangulation domain is constructed. In this way the shape of triangular elements on the triangulation domain is approximately preserved when mapped into three-dimensional space. We also provide an efficient method to achieve a good initial guess for the minimization of the mapping error function. Furthermore, our proposed method guarantees a homeomorphism between a triangulation domain and parametric space/given surface patch by robustly removing the possibility of selfintersection on the developed surface net. Practical application of the proposed algorithm can include the formation of ship hulls, ducts, shoes, clothing and automobile parts as well as the surface meshing procedure.
๐ SIMILAR VOLUMES
Algorithms are developed for approximation of surfaces of revolution by parts of cones and cylinders. The method can be extended to other surfaces generated by moving a planar curve. The main idea is to use the offset curves with an offset ฯฎ of a given planar curve for controlling the approximation