Abstract
Freudental's algorithm obtained way back in early forties have been traditionally used for simplicial triangulating of the hypercube. The main advantage of this algorithm is that it only generates one congruence class. Unfortunately, Freudental's algorithm is not optimal with respect to the measure of degeneracy. The multigrid methods require the degeneracy measure to be as small as possible. The minimal subdivision in the 3-dimensional case and the uniform tesseract corner subdivision in the 4-dimensional case are optimal in regards the measure of degeneracy and multigrid applications. The question about the optimal refinement strategy in more dimensional cases is still an open problem. This paper deals with a penteract subdivision with degeneracy measure much better than one obtained by the Freudental algorithm.
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 callMore From: Scientific Publications of the State University of Novi Pazar Series A: Applied Mathematics, Informatics and mechanics
Disclaimer: 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.
