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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 call
