Abstract
An algorithm is developed for identifying interior nodes and edges in finite element meshes of three-dimensional solids. The algorithm is extremely simple and quite fast. The interior nodes are identified by assembling the normals to all surfaces of the model according to the usual finite element assembly procedure. Comparison with a sort-search algorithm shows a tenfold reduction in running time; running time is a linear function of the number of nodes or elements.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
