AN ALGORITHM TO IMPROVE EDGE NODE SPACING OF A TWELVE-NODED QUADRILATERAL PATCH

Authors
  1. Stredulinsky, D.C.
Corporate Authors
Defence Research Establishment Atlantic, Dartmouth NS (CAN)
Abstract
An algorithm has been developed to relocate the nodes on an edge of a 12-noded quadrilateral patch to achieve equal node spacing. It has been incorporated in the in-house computer code SHPHUL which is used to generate ship hull finite element models from lines of form. The method is based on finding the new edge node locations, lying on the cubic curve passing through the two corner nodes and two original edge nodes, such that the straight line distances between the nodes are equal. A linearized equation is developed which is used to estimate the new node locations. Further iterations of the equation can be used to converge as closely as desired to equal distances between nodes. In practice, a hull line of form can be broken into several segments so that the pitch edge is relatively close to a straight line. When the maximum spacing between the patch edge and the straight line between corner nodes is less than 20 percent of the edge length, convergence is rapid and only one or two iterations are needed. The method is more efficient than an alternative method based on numerical integration of the distance along the patch edge but it is limited to the case where the patch edge is relatively close to a straight line, as in the case in the present application.
Keywords
SHPHUL
Report Number
DREA-TM-93-218 — Technical Memorandum
Date of publication
01 Dec 1993
Number of Pages
20
DSTKIM No
94-00427
CANDIS No
137150
Format(s):
Hardcopy;Originator's fiche received by DSIS

Permanent link

Document 1 of 1

Date modified: