Has anyone done any work describing geometrical problems in a CSP? I mean things like: Circle C(P,R) has midpoint P and radius R. P lies on the line joining P1 and P2. C touches circle Ck(Pk, Rk) Find the solution that minimises d(P, Q) etc. Malcolm -- "The modern man in revolt has become practically useless for all purposes of revolt. By rebelling against everything he has lost his right to rebel against anything." - G.K.Chesterton, OrthodoxyReceived on Thu Oct 04 2007 - 06:25:20 CEST
This archive was generated by hypermail 2.2.0 : Thu Feb 02 2012 - 02:31:58 CET