Are there any problems that are NP-complete when using Euclidean geometry but are well-defined and solvable in polynomial time for some non-euclidean geometry?
Problem NP-complete for Euclidean geometry but in P for Non-Euclidean geometry?
reference request;cg.comp geom