Algorithm for fixing singular defects of polygon meshes based on half-edge data structure.
Danylo ShovheliaNatalya SokolovaPublished in: CMIS (2020)
Keyphrases
- data structure
- dynamic programming
- cost function
- learning algorithm
- convex hull
- matching algorithm
- preprocessing
- computational cost
- np hard
- worst case
- delaunay triangulation
- detection algorithm
- computational complexity
- significant improvement
- k means
- expectation maximization
- optimization algorithm
- tree structure
- objective function
- mesh generation
- kd trees
- genetic algorithm
- simulated annealing
- particle swarm optimization
- optimal solution
- undirected graph
- suffix tree
- image processing