Abstract
This paper presents a procedure for the discretization of 2D domains using a Delaunay triangulation. Improvements over existing similar methods are introduced, proposing in particular a multi-constraint insertion algorithm, very effective in the presence of highly irregular domains, and the topological structure used together with its primitives. The method obtained requires limited input and can be applied to a wide class of domains. Quadrilateral subdivisions with a control of the aspect ratio of the generated elements can also be reached. Further it is suitable for evolutionary problems, which require continuous updating of the discretization. Presented applications and comparisons with other discretization methods demonstrate the effectiveness of the procedure.
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.
