Premium
Improved many‐to‐one sweeping
Author(s) -
Scott Michael A.,
Benzley Steven E.,
Owen Steven J.
Publication year - 2005
Publication title -
international journal for numerical methods in engineering
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.421
H-Index - 168
eISSN - 1097-0207
pISSN - 0029-5981
DOI - 10.1002/nme.1444
Subject(s) - projection (relational algebra) , node (physics) , modular design , computer science , scheme (mathematics) , element (criminal law) , distortion (music) , quality (philosophy) , algorithm , software , mathematics , engineering , computer network , structural engineering , operating system , mathematical analysis , amplifier , philosophy , bandwidth (computing) , epistemology , law , political science
Abstract This paper presents PMOST, the polymorphic many‐to‐one sweep tool. Through its polymorphic design it is able to project nodes quickly and with high quality through ‘modular’ node projection schemes. PMOST currently employs two different node projection schemes: Faceted and BoundaryError node projectors. Implementation details are presented for both of these methods. The proposed many‐to‐one sweep tool was compared to existing software with respect to speed and element quality. Performance testing using PMOST showed that the Faceted node projection scheme was the most efficient while the BoundaryError method produced less element distortion while approximating the efficiency of the Faceted scheme. We also demonstrate improved performance with respect to both element quality and algorithm efficiency when compared to other existing node projection methods. Published in 2005 by John Wiley & Sons, Ltd.