Login / Signup
Linear-Time Algorithms for Visibility and Shortest Path Problems Inside Triangulated Simple Polygons.
Leonidas J. Guibas
John Hershberger
Daniel Leven
Micha Sharir
Robert Endre Tarjan
Published in:
Algorithmica (1987)
Keyphrases
</>
worst case
combinatorial optimization problems
optimization problems
shortest path problem
orders of magnitude
black box
neural network
computational cost
times faster
combinatorial optimization
linear space
computational complexity
cost function
np hard
genetic programming
simple polygon