Minimizing the trace length of a rod endpoint in the presence of polygonal obstacles is NP-hard.
Tetsuo AsanoDavid G. KirkpatrickChee-Keng YapPublished in: CCCG (2003)
Keyphrases
- np hard
- special case
- minimum length
- scheduling problem
- endpoints
- optimal solution
- remains np hard
- approximation algorithms
- np complete
- evolutionary algorithm
- minimum cost
- fixed length
- constraint satisfaction problems
- single machine
- greedy heuristic
- np hardness
- search algorithm
- visual navigation
- artificial intelligence