An Algorithm to Construct Greedy Drawings of Triangulations.
Patrizio AngeliniFabrizio FratiLuca GrilliPublished in: J. Graph Algorithms Appl. (2010)
Keyphrases
- times faster
- search space
- learning algorithm
- dynamic programming
- detection algorithm
- improved algorithm
- computational complexity
- preprocessing
- clustering method
- computational cost
- worst case
- optimization algorithm
- optimal solution
- theoretical analysis
- experimental evaluation
- k means
- estimation algorithm
- locally optimal
- greedy strategy
- convergence rate
- convex hull
- computationally efficient
- particle swarm optimization
- high accuracy
- significant improvement