Talk:2.5D
From Wikipedia, the free encyclopedia
The writer claims that "while optimal cutting tool paths for true 3-dimensional objects can be NP-complete, although many algorithms exist", I don't know where did the author get that knowledge, but based on my years' of study on path planning problem, unless you only allow the cutting tools to move along finite directions, for example, only along x or y directions on a grid, you cannot proof this problem is NPC.
[edit] Picture
This article needs a photo.
- Exactly my sentiments. --W3stfa11 06:31, 26 January 2007 (UTC)
 |
It is requested that a photograph or photographs be included in this article to improve its quality. |
