Linear Time Algorithms for Visibility and Shortest Path Problems Inside Simple Polygons.
Leonidas J. GuibasJohn HershbergerDaniel LevenMicha SharirRobert Endre TarjanPublished in: SCG (1986)
Keyphrases
- learning algorithm
- shortest path problem
- worst case
- black box
- computationally efficient
- computational complexity
- computational cost
- optimization problems
- recently developed
- significant improvement
- combinatorial optimization problems
- probabilistic model
- neural network
- search algorithm
- computational efficiency
- data clustering
- data structure
- reinforcement learning
- simple polygon