A Linear Expected-Time Algorithm for Computing Planar Relative Neighbourhood Graphs.
Jyrki KatajainenOlli NevalainenJukka TeuholaPublished in: Inf. Process. Lett. (1987)
Keyphrases
- k means
- computational cost
- improved algorithm
- detection algorithm
- optimization algorithm
- dynamic programming
- times faster
- learning algorithm
- computational complexity
- significant improvement
- cost function
- np hard
- experimental evaluation
- particle swarm optimization
- neural network
- simulated annealing
- search space
- segmentation algorithm
- graph cuts
- piecewise linear
- graph construction
- linear complexity
- planar graphs
- graph isomorphism