Generation of polygonal meshes in compact space

DOI10.1007/978-3-031-40594-5_1MaRDI QIDQ7325637zbMATH OpenFDO

Authors Sergio Salinas-Fernández, José Fuentes-Sepúlveda, Nancy Hitschfeld-Kahler

Publication date 8 September 2026

Full work available at URL https://doi.org/10.1007/978-3-031-40594-5_1

Mathematics Subject Classification ID

Numerical analysis (65-XX)

Cites work

• A Census of Planar Maps
• A new scheme for the generation of a graded quadrilateral mesh
• Array-based compact data structures for triangulations: practical solutions with theoretical guarantees
• BASIC PRINCIPLES OF VIRTUAL ELEMENT METHODS
• Benchmarking the geometrical robustness of a virtual element Poisson solver
• Blossom-Quad: a non-uniform quadrilateral mesh generator using a minimum-cost perfect-matching algorithm
• Catalog-based representation of 2D triangulations
• Computational geometry. Algorithms and applications.
• Fast and compact planar embeddings
• Finding the intersection of two convex polyhedra
• Finite element mesh generation methods: A review and classification
• scientific article; zbMATH DE number 1343168 (Why is no real title available?)
• Navigating planar topologies in near-optimal space and time
• New longest-edge algorithms for the refinement and/or improvement of unstructured triangulations
• On nonconvex meshes for elastodynamics using virtual element methods with explicit time integration
• Polygon mesh repairing: an application perspective
• Some basic formulations of the virtual element method (VEM) for finite deformations
• The quickhull algorithm for convex hulls
• Voronoi cell finite elements

This page was built for publication: Generation of polygonal meshes in compact space

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7325637)