Counting and Enumerating Pointed Pseudotriangulations with the Greedy Flip Algorithm.
Hervé BrönnimannLutz KettnerMichel PocchiolaJack SnoeyinkPublished in: SIAM J. Comput. (2006)
Keyphrases
- detection algorithm
- dynamic programming
- times faster
- single pass
- computational complexity
- objective function
- improved algorithm
- experimental evaluation
- k means
- computational cost
- optimization algorithm
- preprocessing
- cost function
- worst case
- input data
- particle swarm optimization
- optimal solution
- neural network
- np hard
- globally optimal
- greedy algorithm
- matching algorithm
- theoretical analysis
- computationally efficient
- simulated annealing
- significant improvement