Graph-Grammar Based Longest-Edge Refinement Algorithm for Three-Dimensional Optimally p Refined Meshes with Tetrahedral Elements.
Albert MosialekAndrzej SzaflarskiRafal PychMarek Kisiel-DorohinickiMaciej PaszynskiAnna PaszynskaPublished in: ICCS (4) (2021)
Keyphrases
- three dimensional
- dynamic programming
- undirected graph
- learning algorithm
- k means
- graph structure
- worst case
- weighted graph
- computational complexity
- preprocessing
- cost function
- graph based algorithm
- adjacency graph
- matching algorithm
- mesh generation
- search space
- clustering algorithm
- vertex set
- edge detection algorithm
- dominating set
- marching cubes
- maximum flow
- random graphs
- graph model
- complex networks
- clustering method
- expectation maximization
- edge detection
- d objects
- np hard
- optimal solution