Existence and construction of Hamiltonian paths and cycles on conforming tetrahedral meshes

DOI10.1080/00207160.2010.496850zbMATH Open1210.05068OpenAlexW2040132991MaRDI QIDQ2995505FDOQ2995505

Authors: Hui Liu, Linbo Zhang 

Publication date: 21 April 2011

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160.2010.496850

Recommendations

• Parallel construction of Hamiltonian paths for conforming tetrahedral meshes
• An efficient algorithm for constructing Hamiltonian paths in meshes
• Hamiltonian tetrahedralizations with Steiner points
• Hamiltonian cycles in polyhedral maps
• The vertex-adjacency dual of a triangulated irregular network has a Hamiltonian cycle.

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Graph algorithms (graph-theoretic aspects) (05C85) Eulerian and Hamiltonian graphs (05C45) Paths and cycles (05C38) Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50) Parallel algorithms in computer science (68W10)

Cites Work

• NETGEN: An advancing front 2D/3D-mesh generator based on abstract rules
• New challenges in dynamic load balancing
• Dynamic load balancing in computational mechanics

Cited In (5)

• The vertex-adjacency dual of a triangulated irregular network has a Hamiltonian cycle.
• Hamiltonian triangular refinements and space-filling curves
• Hamiltonian tetrahedralizations with Steiner points
• An efficient algorithm for constructing Hamiltonian paths in meshes
• Parallel construction of Hamiltonian paths for conforming tetrahedral meshes

Uses Software

• Netgen

This page was built for publication: Existence and construction of Hamiltonian paths and cycles on conforming tetrahedral meshes

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