Eine Plattform für die Wissenschaft: Bauingenieurwesen, Architektur und Urbanistik
The algorithm of subdivide coons-surface with any appointed data point
In order to realize the partial modification of coons-surface and its subtler optimization, we should subdivide the coons-surface with appointed data. So, an algorithm of subdividing a coons-surface was presented by authors. First we calculate the boundary conditions of sub division surfaces based on the algorithm for C2 Hermite interpolation and the designated data points. Then we reconstruct these sub division surfaces according to above calculating boundary conditions and blend them. The experimental results show that these sub surfaces created by this algorithm can be blended well, and the blended surface has same shape with original coons-surface.
The algorithm of subdivide coons-surface with any appointed data point
In order to realize the partial modification of coons-surface and its subtler optimization, we should subdivide the coons-surface with appointed data. So, an algorithm of subdividing a coons-surface was presented by authors. First we calculate the boundary conditions of sub division surfaces based on the algorithm for C2 Hermite interpolation and the designated data points. Then we reconstruct these sub division surfaces according to above calculating boundary conditions and blend them. The experimental results show that these sub surfaces created by this algorithm can be blended well, and the blended surface has same shape with original coons-surface.
The algorithm of subdivide coons-surface with any appointed data point
Jun Tan, (Autor:in) / Lijun Jiang, (Autor:in)
01.11.2009
103179 byte
Aufsatz (Konferenz)
Elektronische Ressource
Englisch
Use of FWD Data to Subdivide Pavement Sections for MEPDG Calibration
British Library Conference Proceedings | 2020
|An allostratigraphic approach to subdivide fine-grained sediments for urban planning
Online Contents | 2016
|An allostratigraphic approach to subdivide fine-grained sediments for urban planning
Online Contents | 2016
|