Abstract
An algorithm for the local refinement of a given triangulation consisting of prisms is presented. In the refined triangulation there can be some nonconforming nodes. It is shown that there exists a conforming triangulation consisting of prisms, pyramids, and tetrahedra which contains the nonconforming one. Proofs for the finiteness of the algorithm and stability of the obtained triangulations are presented.
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.
