Hamiltonian triangular refinements and space-filling curves
From MaRDI portal
Publication:1624615
DOI10.1016/j.cam.2018.06.029zbMath1402.65174OpenAlexW2858068040WikidataQ129552757 ScholiaQ129552757MaRDI QIDQ1624615
José P. Suárez, Ángel Plaza, Alberto Márquez
Publication date: 16 November 2018
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://idus.us.es/handle//11441/111761
Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50)
Cites Work
- Counting triangulations of some classes of subdivided convex polygons
- The vertex-adjacency dual of a triangulated irregular network has a Hamiltonian cycle.
- Flipping edges in triangulations
- The eight-tetrahedra longest-edge partition and Kuhn triangulations
- A new adaptive mesh refinement strategy for numerically solving evolutionary PDE's
- Space-Filling Curves
- Existence and construction of Hamiltonian paths and cycles on conforming tetrahedral meshes
- Propagation of longest-edge mesh patterns in local adaptive refinement
- Right-triangulated irregular networks
This page was built for publication: Hamiltonian triangular refinements and space-filling curves