An O(E log E + I) Expected Time Algorithm for the Planar Segment Intersection Problem.
Eugene W. MyersPublished in: SIAM J. Comput. (1985)
Keyphrases
- np hard
- experimental evaluation
- optimal solution
- selection algorithm
- objective function
- computational complexity
- preprocessing
- matching algorithm
- optimization algorithm
- theoretical analysis
- high accuracy
- probabilistic model
- computational cost
- convex hull
- worst case
- neural network
- significant improvement
- search space
- learning algorithm
- particle swarm optimization
- cost function
- times faster
- bayesian networks
- convergence rate